Alexandre Pinlou

63 papers A 1Journal 61

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. Discret. Math. Christopher Duffy, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou
2022	J	`jnl`	The chromatic number of signed graphs with bounded maximum average degree. Discret. Appl. Math. Fabien Jacques, Alexandre Pinlou
2021	J	`jnl`	The chromatic number of signed graphs with bounded maximum average degree. CoRR Fabien Jacques, Alexandre Pinlou
2021	J	`jnl`	r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. Eur. J. Comb. Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov
2020	J	`jnl`	Acyclic coloring of graphs and entropy compression method. Discret. Math. Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
2020	J	`jnl`	On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou, Roman Soták
2020	J	`jnl`	Oriented cliques and colorings of graphs with low maximum degree. Discret. Math. Janusz Dybizbanski, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski
2020	J	`jnl`	The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. CoRR Christopher Duffy, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou
2019	J	`jnl`	A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discret. Math. François Dross, Mickaël Montassier, Alexandre Pinlou
2019	J	`jnl`	Homothetic triangle representations of planar graphs. CoRR Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2019	J	`jnl`	Large induced forests in planar graphs with girth 4. Discret. Appl. Math. François Dross, Mickaël Montassier, Alexandre Pinlou
2019	J	`jnl`	Oriented coloring of graphs with low maximum degree. CoRR Pascal Ochem, Alexandre Pinlou
2018	J	`jnl`	On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. Electron. J. Comb. Borut Luzar, Pascal Ochem, Alexandre Pinlou
2018	J	`jnl`	Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. Electron. J. Comb. François Dross, Mickaël Montassier, Alexandre Pinlou
2017	J	`jnl`	A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. CoRR François Dross, Mickaël Montassier, Alexandre Pinlou
2017	J	`jnl`	Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. J. Graph Theory Pascal Ochem, Alexandre Pinlou, Sagnik Sen
2017	J	`jnl`	On repetition thresholds of caterpillars and trees of bounded degree. CoRR Borut Luzar, Pascal Ochem, Alexandre Pinlou
2017	J	`jnl`	On the difference between the Szeged and the Wiener index. Appl. Math. Comput. Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski
2017	J	`jnl`	Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Eur. J. Comb. François Dross, Mickaël Montassier, Alexandre Pinlou
2016	J	`jnl`	A lower bound on the order of the largest induced forest in planar graphs with high girth. Discret. Appl. Math. François Dross, Mickaël Montassier, Alexandre Pinlou
2016	J	`jnl`	Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. CoRR François Dross, Mickaël Montassier, Alexandre Pinlou
2016	J	`jnl`	Partitioning sparse graphs into an independent set and a forest of bounded degree. CoRR François Dross, Mickaël Montassier, Alexandre Pinlou
2016	J	`jnl`	Planar graphs with Δ≥7 and no triangle adjacent to a C Discret. Math. Theor. Comput. Sci. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2015	J	`jnl`	A lower bound on the order of the largest induced forest in planar graphs with high girth. CoRR François Dross, Mickaël Montassier, Alexandre Pinlou
2015	J	`jnl`	Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Electron. Notes Discret. Math. François Dross, Mickaël Montassier, Alexandre Pinlou
2014	J	`jnl`	2-Distance Coloring of Sparse Graphs. J. Graph Theory Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	Application of Entropy Compression in Pattern Avoidance. Electron. J. Comb. Pascal Ochem, Alexandre Pinlou
2014	J	`jnl`	Entropy compression method applied to graph colorings. CoRR Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
2014	J	`jnl`	Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. Discret. Math. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	Homomorphisms of signed planar graphs. CoRR Pascal Ochem, Alexandre Pinlou, Sagnik Sen
2014	J	`jnl`	Large induced forests in planar graphs with girth 4 or 5. CoRR François Dross, Mickaël Montassier, Alexandre Pinlou
2014	J	`jnl`	List coloring the square of sparse graphs with large degree. Eur. J. Comb. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Graphs Comb. Pascal Ochem, Alexandre Pinlou
2014	J	`jnl`	Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	—	`book`	Some Problems in Graph Coloring: Methods, Extensions and Results. Alexandre Pinlou
2013	J	`jnl`	A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
2013	J	`jnl`	Application of entropy compression in pattern avoidance CoRR Pascal Ochem, Alexandre Pinlou
2013	J	`jnl`	Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2013	J	`jnl`	List coloring the square of sparse graphs with large degree. CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2013	J	`jnl`	Locally identifying coloring in bounded expansion classes of graphs. Discret. Appl. Math. Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
2012	J	`jnl`	Locally identifying coloring in bounded expansion classes of graphs CoRR Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
2012	J	`jnl`	On spanning galaxies in digraphs. Discret. Appl. Math. Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé
2012	J	`jnl`	Triangle Contact Representations and Duality. Discret. Comput. Geom. Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2011	J	`jnl`	2-distance coloring of sparse graphs. Electron. Notes Discret. Math. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2011	J	`jnl`	Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Electron. Notes Discret. Math. Pascal Ochem, Alexandre Pinlou
2011	J	`jnl`	The Domination Number of Grids CoRR Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
2011	J	`jnl`	The Domination Number of Grids. SIAM J. Discret. Math. Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
2010	J	`jnl`	Acyclic improper colourings of graphs with bounded maximum degree. Discret. Math. Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou
2010	J	`jnl`	Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
2010	A	`conf`	Triangle Contact Representations and Duality. GD Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2009	J	`jnl`	An oriented coloring of planar graphs with girth at least five. Discret. Math. Alexandre Pinlou
2009	J	`jnl`	Chromatic number of sparse colored mixed planar graphs. Electron. Notes Discret. Math. Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena
2009	J	`jnl`	Spanning galaxies in digraphs. Electron. Notes Discret. Math. Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet
2008	J	`jnl`	Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
2008	J	`jnl`	On the oriented chromatic index of oriented graphs. J. Graph Theory Pascal Ochem, Alexandre Pinlou, Éric Sopena
2008	J	`jnl`	Oriented colorings of partial 2-trees. Inf. Process. Lett. Pascal Ochem, Alexandre Pinlou
2008	J	`jnl`	Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discret. Math. Theor. Comput. Sci. Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
2008	J	`jnl`	Strong oriented chromatic number of planar graphs without cycles of specific lengths. Electron. Notes Discret. Math. Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
2007	J	`jnl`	Acyclic improper choosability of graphs. Electron. Notes Discret. Math. Louis Esperet, Alexandre Pinlou
2007	J	`jnl`	Oriented vertex and arc colorings of partial 2-trees. Electron. Notes Discret. Math. Pascal Ochem, Alexandre Pinlou
2006	J	`jnl`	On Oriented Arc-Coloring of Subcubic Graphs. Electron. J. Comb. Alexandre Pinlou
2006	J	`jnl`	Oriented vertex and arc colorings of outerplanar graphs. Inf. Process. Lett. Alexandre Pinlou, Éric Sopena
2006	J	`jnl`	The acircuitic directed star arboricity of subcubic graphs is at most four. Discret. Math. Alexandre Pinlou, Éric Sopena