Alexandre Pinlou
Alexandre Pinlou
LIRMM, University of Montpellier
Preverjeni e-poštni naslov na lirmm.fr - Domača stran
Naslov
Navedeno
Navedeno
Leto
The domination number of grids
D Gonçalves, A Pinlou, M Rao, S Thomassé
SIAM Journal on Discrete Mathematics 25 (3), 1443-1453, 2011
1212011
Entropy compression method applied to graph colorings
D Gonçalves, M Montassier, A Pinlou
arXiv preprint arXiv:1406.4380, 2014
512014
Triangle contact representations and duality
D Gonçalves, B Lévêque, A Pinlou
Discrete & Computational Geometry 48 (1), 239-254, 2012
502012
Triangle contact representations and duality
D Gonçalves, B Lévêque, A Pinlou
Graph Drawing, 262-273, 2010
502010
2‐Distance Coloring of Sparse Graphs
M Bonamy, B Lévêque, A Pinlou
Journal of Graph Theory 77 (3), 190-218, 2014
322014
Homomorphisms of 2-edge-colored graphs
A Montejano, P Ochem, A Pinlou, A Raspaud, É Sopena
Discrete Applied Mathematics 158 (12), 1365-1379, 2010
302010
Oriented vertex and arc colorings of outerplanar graphs
A Pinlou, É Sopena
Information Processing Letters 100, 97-104, 2006
302006
Graphs with maximum degree Δ≥ 17 and maximum average degree less than 3 are list 2-distance (Δ+ 2)-colorable
M Bonamy, B Lévêque, A Pinlou
Discrete Mathematics 317, 19-32, 2014
292014
A complexity dichotomy for the coloring of sparse graphs
L Esperet, M Montassier, P Ochem, A Pinlou
Journal of Graph Theory 73 (1), 85-102, 2013
272013
Application of entropy compression in pattern avoidance
P Ochem, A Pinlou
Electronic journal of combinatorics 21 (2), 1-12, 2013
242013
Oriented colorings of partial 2-trees
P Ochem, A Pinlou
Information Processing Letters 108 (2), 82-86, 2008
232008
Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
P Ochem, A Pinlou, S Sen
Journal of Graph Theory 85 (1), 258-277, 2017
222017
An oriented coloring of planar graphs with girth at least five
A Pinlou
Discrete Mathematics 309 (8), 2108-2118, 2009
212009
On the oriented chromatic index of oriented graphs
P Ochem, A Pinlou, É Sopena
Journal of Graph Theory 57 (4), 313-332, 2008
152008
List coloring the square of sparse graphs with large degree
M Bonamy, B Lévêque, A Pinlou
European Journal of Combinatorics 41, 128-137, 2014
122014
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
P Ochem, A Pinlou
Graphs and Combinatorics 30 (2), 439-453, 2014
112014
Locally identifying coloring in bounded expansion classes of graphs
D Gonçalves, A Parreau, A Pinlou
Discrete Applied Mathematics 161 (18), 2946-2951, 2013
112013
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
F Dross, M Montassier, A Pinlou
European Journal of Combinatorics 66, 81-94, 2017
102017
2-distance coloring of sparse graphs
M Bonamy, B Lévêque, A Pinlou
Electronic Notes in Discrete Mathematics 38, 155-160, 2011
102011
On the difference between the Szeged and the Wiener index
M Bonamy, M Knor, B Lužar, A Pinlou, R Škrekovski
Applied Mathematics and Computation 312, 202-213, 2017
92017
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20