Feedback vertex sets of planar digraphs with fixed digirth.

Alexandre Pinlou

Simon Dreyer Alexandre Pinlou Petru Valicov Feedback vertex sets of planar digraphs with fixed digirth. 2026 May abs/2605.12279 CoRR https://doi.org/10.48550/arXiv.2605.12279 db/journals/corr/corr2605.html#abs-2605-12279 streams/journals/corr

Christopher Duffy 0001 Fabien Jacques Mickaël Montassier Alexandre Pinlou The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. 113579 2023 346 Discret. Math. 10 https://doi.org/10.1016/j.disc.2023.113579 db/journals/dm/dm346.html#0001JMP23

Fabien Jacques Alexandre Pinlou The chromatic number of signed graphs with bounded maximum average degree. 43-59 2022 316 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2022.03.025 https://www.wikidata.org/entity/Q114191461 db/journals/dam/dam316.html#JacquesP22

Hoang La Mickaël Montassier Alexandre Pinlou Petru Valicov r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. 103219 2021 91 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2020.103219 db/journals/ejc/ejc91.html#LaMPV21

Fabien Jacques Alexandre Pinlou The chromatic number of signed graphs with bounded maximum average degree. 2021 abs/2104.11121 CoRR https://arxiv.org/abs/2104.11121 db/journals/corr/corr2104.html#abs-2104-11121

Borut Luzar Martina Mockovciaková Pascal Ochem Alexandre Pinlou Roman Soták On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. 106-117 2020 279 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.10.013 db/journals/dam/dam279.html#LuzarMOPS20

Daniel Gonçalves 0001 Mickaël Montassier Alexandre Pinlou Acyclic coloring of graphs and entropy compression method. 111772 2020 343 Discret. Math. 4 https://doi.org/10.1016/j.disc.2019.111772 db/journals/dm/dm343.html#GoncalvesMP20

Janusz Dybizbanski Pascal Ochem Alexandre Pinlou Andrzej Szepietowski Oriented cliques and colorings of graphs with low maximum degree. 111829 2020 343 Discret. Math. 5 https://doi.org/10.1016/j.disc.2020.111829 db/journals/dm/dm343.html#DybizbanskiOPS20

Christopher Duffy 0001 Fabien Jacques Mickaël Montassier Alexandre Pinlou The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. 2020 abs/2009.05439 CoRR https://arxiv.org/abs/2009.05439 db/journals/corr/corr2009.html#abs-2009-05439

François Dross Mickaël Montassier Alexandre Pinlou Large induced forests in planar graphs with girth 4. 96-106 2019 254 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.06.029 db/journals/dam/dam254.html#DrossMP19

François Dross Mickaël Montassier Alexandre Pinlou A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. 943-950 2019 342 Discret. Math. 4 https://doi.org/10.1016/j.disc.2018.11.023 db/journals/dm/dm342.html#DrossMP19

Pascal Ochem Alexandre Pinlou Oriented coloring of graphs with low maximum degree. 2019 abs/1905.12484 CoRR http://arxiv.org/abs/1905.12484 db/journals/corr/corr1905.html#abs-1905-12484

Daniel Gonçalves 0001 Benjamin Lévêque Alexandre Pinlou Homothetic triangle representations of planar graphs. 2019 abs/1908.11749 CoRR http://arxiv.org/abs/1908.11749 db/journals/corr/corr1908.html#abs-1908-11749

François Dross Mickaël Montassier Alexandre Pinlou Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. 1 2018 25 Electron. J. Comb. 1 https://doi.org/10.37236/6815 db/journals/combinatorics/combinatorics25.html#DrossMP18

Borut Luzar Pascal Ochem Alexandre Pinlou On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. 1 2018 25 Electron. J. Comb. 1 https://doi.org/10.37236/6793 db/journals/combinatorics/combinatorics25.html#LuzarOP18

Marthe Bonamy Martin Knor Borut Luzar Alexandre Pinlou Riste Skrekovski On the difference between the Szeged and the Wiener index. 202-213 2017 312 Appl. Math. Comput. https://doi.org/10.1016/j.amc.2017.05.047 db/journals/amc/amc312.html#BonamyKLPS17

François Dross Mickaël Montassier Alexandre Pinlou Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. 81-94 2017 66 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2017.06.014 db/journals/ejc/ejc66.html#DrossMP17

Pascal Ochem Alexandre Pinlou Sagnik Sen 0001 Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. 258-277 2017 85 J. Graph Theory 1 https://doi.org/10.1002/jgt.22059 db/journals/jgt/jgt85.html#OchemPS17

Borut Luzar Pascal Ochem Alexandre Pinlou On repetition thresholds of caterpillars and trees of bounded degree. 2017 abs/1702.01058 CoRR http://arxiv.org/abs/1702.01058 db/journals/corr/corr1702.html#LuzarOP17

François Dross Mickaël Montassier Alexandre Pinlou A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. 2017 abs/1705.11133 CoRR http://arxiv.org/abs/1705.11133 db/journals/corr/corr1705.html#DrossMP17

François Dross Mickaël Montassier Alexandre Pinlou A lower bound on the order of the largest induced forest in planar graphs with high girth. 99-107 2016 214 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2016.06.011 db/journals/dam/dam214.html#DrossMP16

Marthe Bonamy Benjamin Lévêque Alexandre Pinlou Planar graphs with Δ≥7 and no triangle adjacent to a C<sub>4</sub> are minimally edge and total choosable. 131-146 2016 17 Discret. Math. Theor. Comput. Sci. 3 https://doi.org/10.46298/dmtcs.2147 db/journals/dmtcs/dmtcs17.html#BonamyLP16

François Dross Mickaël Montassier Alexandre Pinlou Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. 2016 abs/1601.01523 CoRR http://arxiv.org/abs/1601.01523 db/journals/corr/corr1601.html#DrossMP16

François Dross Mickaël Montassier Alexandre Pinlou Partitioning sparse graphs into an independent set and a forest of bounded degree. 2016 abs/1606.04394 CoRR http://arxiv.org/abs/1606.04394 db/journals/corr/corr1606.html#DrossMP16a

François Dross Mickaël Montassier Alexandre Pinlou Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. 269-275 2015 49 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2015.06.037 db/journals/endm/endm49.html#DrossMP15

François Dross Mickaël Montassier Alexandre Pinlou A lower bound on the order of the largest induced forest in planar graphs with high girth. 2015 abs/1504.01949 CoRR http://arxiv.org/abs/1504.01949 db/journals/corr/corr1504.html#DrossMP15

Alexandre Pinlou Some Problems in Graph Coloring: Methods, Extensions and Results. 2014 Montpellier 2 University, France https://tel.archives-ouvertes.fr/tel-01376199

Pascal Ochem Alexandre Pinlou Application of Entropy Compression in Pattern Avoidance. 2 2014 21 Electron. J. Comb. 2 https://doi.org/10.37236/3038 db/journals/combinatorics/combinatorics21.html#OchemP14

Marthe Bonamy Benjamin Lévêque Alexandre Pinlou Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. 19-32 2014 317 Discret. Math. https://doi.org/10.1016/j.disc.2013.10.022 db/journals/dm/dm317.html#BonamyLP14

Marthe Bonamy Benjamin Lévêque Alexandre Pinlou List coloring the square of sparse graphs with large degree. 128-137 2014 41 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2014.03.006 db/journals/ejc/ejc41.html#BonamyLP14

Pascal Ochem Alexandre Pinlou Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. 439-453 2014 30 Graphs Comb. 2 https://doi.org/10.1007/s00373-013-1283-2 db/journals/gc/gc30.html#OchemP14

Marthe Bonamy Benjamin Lévêque Alexandre Pinlou 2-Distance Coloring of Sparse Graphs. 190-218 2014 77 J. Graph Theory 3 https://doi.org/10.1002/jgt.21782 db/journals/jgt/jgt77.html#BonamyLP14

Pascal Ochem Alexandre Pinlou Sagnik Sen 0001 Homomorphisms of signed planar graphs. 2014 abs/1401.3308 CoRR http://arxiv.org/abs/1401.3308 db/journals/corr/corr1401.html#OchemPS14

Marthe Bonamy Benjamin Lévêque Alexandre Pinlou Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C<sub>4</sub> are minimally edge and total choosable. 2014 abs/1405.3422 CoRR http://arxiv.org/abs/1405.3422 db/journals/corr/corr1405.html#BonamyLP14

Daniel Gonçalves 0001 Mickaël Montassier Alexandre Pinlou Entropy compression method applied to graph colorings. 2014 abs/1406.4380 CoRR http://arxiv.org/abs/1406.4380 db/journals/corr/corr1406.html#0001MP14

François Dross Mickaël Montassier Alexandre Pinlou Large induced forests in planar graphs with girth 4 or 5. 2014 abs/1409.1348 CoRR http://arxiv.org/abs/1409.1348 db/journals/corr/corr1409.html#DrossMP14

Daniel Gonçalves 0001 Aline Parreau Alexandre Pinlou Locally identifying coloring in bounded expansion classes of graphs. 2946-2951 2013 161 Discret. Appl. Math. 18 https://doi.org/10.1016/j.dam.2013.07.003 db/journals/dam/dam161.html#GoncalvesPP13

Louis Esperet Mickaël Montassier Pascal Ochem Alexandre Pinlou A Complexity Dichotomy for the Coloring of Sparse Graphs. 85-102 2013 73 J. Graph Theory 1 https://doi.org/10.1002/jgt.21659 db/journals/jgt/jgt73.html#EsperetMOP13

Pascal Ochem Alexandre Pinlou Application of entropy compression in pattern avoidance http://arxiv.org/abs/1301.1873 2013 CoRR abs/1301.1873 db/journals/corr/corr1301.html#abs-1301-1873

Marthe Bonamy Benjamin Lévêque Alexandre Pinlou Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable http://arxiv.org/abs/1301.7090 2013 CoRR abs/1301.7090 db/journals/corr/corr1301.html#abs-1301-7090

Marthe Bonamy Benjamin Lévêque Alexandre Pinlou List coloring the square of sparse graphs with large degree. 2013 CoRR http://arxiv.org/abs/1308.4197 abs/1308.4197 db/journals/corr/corr1308.html#BonamyLP13

Daniel Gonçalves 0001 Frédéric Havet Alexandre Pinlou Stéphan Thomassé On spanning galaxies in digraphs. 744-754 2012 160 Discret. Appl. Math. 6 https://doi.org/10.1016/j.dam.2011.07.013 db/journals/dam/dam160.html#GoncalvesHPT12

Daniel Gonçalves 0001 Benjamin Lévêque Alexandre Pinlou Triangle Contact Representations and Duality. 239-254 2012 48 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-012-9400-1 db/journals/dcg/dcg48.html#GoncalvesLP12

Daniel Gonçalves 0001 Aline Parreau Alexandre Pinlou Locally identifying coloring in bounded expansion classes of graphs http://arxiv.org/abs/1212.5468 2012 CoRR abs/1212.5468 db/journals/corr/corr1212.html#abs-1212-5468

Pascal Ochem Alexandre Pinlou Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. 123-128 2011 37 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.05.022 db/journals/endm/endm37.html#OchemP11

Marthe Bonamy Benjamin Lévêque Alexandre Pinlou 2-distance coloring of sparse graphs. 155-160 2011 38 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.09.027 db/journals/endm/endm38.html#BonamyLP11

Daniel Gonçalves 0001 Alexandre Pinlou Michaël Rao Stéphan Thomassé The Domination Number of Grids. 1443-1453 2011 25 SIAM J. Discret. Math. 3 https://doi.org/10.1137/11082574 db/journals/siamdm/siamdm25.html#GoncalvesPRT11

Daniel Gonçalves 0001 Alexandre Pinlou Michaël Rao Stéphan Thomassé The Domination Number of Grids http://arxiv.org/abs/1102.5206 2011 CoRR abs/1102.5206 db/journals/corr/corr1102.html#abs-1102-5206

Amanda Montejano Pascal Ochem Alexandre Pinlou André Raspaud Éric Sopena Homomorphisms of 2-edge-colored graphs. 1365-1379 2010 158 Discret. Appl. Math. 12 https://doi.org/10.1016/j.dam.2009.09.017 db/journals/dam/dam158.html#MontejanoOPRS10

Louigi Addario-Berry Louis Esperet Ross J. Kang Colin J. H. McDiarmid Alexandre Pinlou Acyclic improper colourings of graphs with bounded maximum degree. 223-229 2010 310 Discret. Math. 2 https://doi.org/10.1016/j.disc.2008.09.009 db/journals/dm/dm310.html#Addario-BerryEKMP10

Daniel Gonçalves 0001 Benjamin Lévêque Alexandre Pinlou Triangle Contact Representations and Duality. 262-273 2010 GD https://doi.org/10.1007/978-3-642-18469-7_24 conf/gd/2010 db/conf/gd/gd2010.html#GoncalvesLP10

Alexandre Pinlou An oriented coloring of planar graphs with girth at least five. 2108-2118 2009 309 Discret. Math. 8 https://doi.org/10.1016/j.disc.2008.04.030 db/journals/dm/dm309.html#Pinlou09

Daniel Gonçalves 0001 Alexandre Pinlou Stéphan Thomassé Frédéric Havet Spanning galaxies in digraphs. 139-143 2009 34 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.07.023 db/journals/endm/endm34.html#GoncalvesPTH09

Amanda Montejano Alexandre Pinlou André Raspaud Éric Sopena Chromatic number of sparse colored mixed planar graphs. 363-367 2009 34 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.07.060 db/journals/endm/endm34.html#MontejanoPRS09

Mickaël Montassier Pascal Ochem Alexandre Pinlou Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. 2008 10 Discret. Math. Theor. Comput. Sci. 1 https://doi.org/10.46298/dmtcs.418 db/journals/dmtcs/dmtcs10.html#MontassierOP08

Mickaël Montassier Pascal Ochem Alexandre Pinlou Strong oriented chromatic number of planar graphs without cycles of specific lengths. 27-32 2008 30 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2008.01.006 db/journals/endm/endm30.html#MontassierOP08

Amanda Montejano Pascal Ochem Alexandre Pinlou André Raspaud Éric Sopena Homomorphisms of 2-edge-colored graphs. 33-38 2008 30 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2008.01.007 db/journals/endm/endm30.html#MontejanoOPRS08

Pascal Ochem Alexandre Pinlou Oriented colorings of partial 2-trees. 82-86 2008 108 Inf. Process. Lett. 2 https://doi.org/10.1016/j.ipl.2008.04.007 db/journals/ipl/ipl108.html#OchemP08

Pascal Ochem Alexandre Pinlou Éric Sopena On the oriented chromatic index of oriented graphs. 313-332 2008 57 J. Graph Theory 4 https://doi.org/10.1002/jgt.20286 db/journals/jgt/jgt57.html#OchemPS08

Louis Esperet Alexandre Pinlou Acyclic improper choosability of graphs. 251-258 2007 28 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2007.01.037 db/journals/endm/endm28.html#EsperetP07

Pascal Ochem Alexandre Pinlou Oriented vertex and arc colorings of partial 2-trees. 195-199 2007 29 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2007.07.034 db/journals/endm/endm29.html#OchemP07

Alexandre Pinlou On Oriented Arc-Coloring of Subcubic Graphs. 2006 13 Electron. J. Comb. 1 https://doi.org/10.37236/1095 db/journals/combinatorics/combinatorics13.html#Pinlou06

Alexandre Pinlou Éric Sopena The acircuitic directed star arboricity of subcubic graphs is at most four. 3281-3289 2006 306 Discret. Math. 24 https://doi.org/10.1016/j.disc.2006.06.007 db/journals/dm/dm306.html#PinlouS06

Alexandre Pinlou Éric Sopena Oriented vertex and arc colorings of outerplanar graphs. 97-104 2006 100 Inf. Process. Lett. 3 https://doi.org/10.1016/j.ipl.2006.06.012 db/journals/ipl/ipl100.html#PinlouS06

Louigi Addario-Berry Marthe Bonamy Simon Dreyer François Dross Christopher Duffy 0001 Janusz Dybizbanski Louis Esperet Daniel Gonçalves 0001 Frédéric Havet Fabien Jacques Ross J. Kang Martin Knor Hoang La Benjamin Lévêque Borut Luzar Colin McDiarmidColin J. H. McDiarmid Martina Mockovciaková Mickaël Montassier Amanda Montejano Pascal Ochem Aline Parreau Michaël Rao André Raspaud Sagnik Sen 0001 Riste Skrekovski Éric Sopena Roman Soták Andrzej Szepietowski Stéphan Thomassé Petru Valicov