Alexandre Pinlou

Présentation

Publications

Article dans une revue (35)

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree Christopher Duffy,Fabien Jacques,Mickaël Montassier,Alexandre Pinlou Discrete Mathematics, 2023, 346 (10), pp.113579. ⟨10.1016/j.disc.2023.113579⟩ Article dans une revue lirmm-04227159v1
The chromatic number of signed graphs with bounded maximum average degree Fabien Jacques,Alexandre Pinlou Discrete Applied Mathematics, 2022, 316 (C), pp.43-59. ⟨10.1016/j.dam.2022.03.025⟩ Article dans une revue hal-04227209v1
$r$-hued ( r + 1 ) -coloring of planar graphs with girth at least 8 for $r$ ≥ 9 Xuan Hoang La,Mickaël Montassier,Alexandre Pinlou,Petru Valicov European Journal of Combinatorics, 2021, 91, pp.#103219. ⟨10.1016/j.ejc.2020.103219⟩ Article dans une revue lirmm-03475125v1
On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 } Borut Lužar,Martina Mockovčiaková,Pascal Ochem,Alexandre Pinlou,Roman Sotak Discrete Applied Mathematics, 2020, 279, pp.106-117. ⟨10.1016/j.dam.2019.10.013⟩ Article dans une revue lirmm-02349883v1
Oriented cliques and colorings of graphs with low maximum degree Janusz Dybizbański,Pascal Ochem,Alexandre Pinlou,Andrzej Szepietowski Discrete Mathematics, 2020, 343 (5), pp.#111829. ⟨10.1016/j.disc.2020.111829⟩ Article dans une revue lirmm-02938614v1
Acyclic coloring of graphs and entropy compression method Daniel Gonçalves,Mickaël Montassier,Alexandre Pinlou Discrete Mathematics, 2020, 343 (4), pp.#111772. ⟨10.1016/j.disc.2019.111772⟩ Article dans une revue lirmm-02938618v1
Homothetic triangle representations of planar graphs Daniel Gonçalves,Benjamin Lévêque,Alexandre Pinlou Journal of Graph Algorithms and Applications, 2019, 23 (4), pp.745-753. ⟨10.7155/jgaa.00509⟩ Article dans une revue lirmm-02407930v1
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs François Dross,Mickaël Montassier,Alexandre Pinlou Discrete Mathematics, 2019, 342 (4), pp.943-950. ⟨10.1016/j.disc.2018.11.023⟩ Article dans une revue lirmm-02010775v1
Large induced forests in planar graphs with girth 4 François Dross,Mickaël Montassier,Alexandre Pinlou Discrete Applied Mathematics, 2019, 254, pp.96-106. ⟨10.1016/j.dam.2018.06.029⟩ Article dans une revue lirmm-02021020v1
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree François Dross,Mickaël Montassier,Alexandre Pinlou The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.45. ⟨10.37236/6815⟩ Article dans une revue lirmm-01730269v1
On repetition thresholds of caterpillars and trees of bounded degree Borut Lužar,Pascal Ochem,Alexandre Pinlou The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.61. ⟨10.37236/6793⟩ Article dans une revue lirmm-01730276v1
On the difference between the Szeged and the Wiener index Marthe Bonamy,Martin Knor,Borut Lužar,Alexandre Pinlou,Riste Škrekovski Applied Mathematics and Computation, 2017, 312, pp.202-213. ⟨10.1016/j.amc.2017.05.047⟩ Article dans une revue lirmm-01730264v1
Homomorphisms of 2-edge-colored triangle-free planar graphs Pascal Ochem,Alexandre Pinlou,Sagnik Sen Journal of Graph Theory, 2017, 85 (1), pp.258-277. ⟨10.1002/jgt.22059⟩ Article dans une revue lirmm-01376130v1
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree François Dross,Mickaël Montassier,Alexandre Pinlou European Journal of Combinatorics, 2017, 66, pp.81-94. ⟨10.1016/j.ejc.2017.06.014⟩ Article dans une revue lirmm-01430784v1
Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable Marthe Bonamy,Benjamin Lévêque,Alexandre Pinlou Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.131-146. ⟨10.46298/dmtcs.2147⟩ Article dans une revue lirmm-01347027v2
A lower bound on the order of the largest induced forest in planar graphs with high girth François Dross,Mickaël Montassier,Alexandre Pinlou Discrete Applied Mathematics, 2016, 214, pp.99-107. ⟨10.1016/j.dam.2016.06.011⟩ Article dans une revue lirmm-01375448v1
Application of entropy compression in pattern avoidance Pascal Ochem,Alexandre Pinlou The Electronic Journal of Combinatorics, 2014, 21 (2), pp.1-12. ⟨10.37236/3038⟩ Article dans une revue lirmm-01233448v1
2-Distance Coloring of Sparse Graphs Marthe Bonamy,Benjamin Lévêque,Alexandre Pinlou Journal of Graph Theory, 2014, 77 (3), pp.190-218. ⟨10.1002/jgt.21782⟩ Article dans une revue lirmm-01233451v1
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs Pascal Ochem,Alexandre Pinlou Graphs and Combinatorics, 2014, 30 (2), pp.439-453. ⟨10.1007/s00373-013-1283-2⟩ Article dans une revue lirmm-00780910v1
Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable Marthe Bonamy,Benjamin Lévêque,Alexandre Pinlou Discrete Mathematics, 2014, 317, pp.19-32. ⟨10.1016/j.disc.2013.10.022⟩ Article dans une revue lirmm-01233453v1
List coloring the square of sparse graphs with large degree Marthe Bonamy,Benjamin Lévêque,Alexandre Pinlou European Journal of Combinatorics, 2014, 41, pp.128-137. ⟨10.1016/j.ejc.2014.03.006⟩ Article dans une revue lirmm-01233445v1
Locally identifying coloring in bounded expansion classes of graphs Daniel Gonçalves,Aline Parreau,Alexandre Pinlou Discrete Applied Mathematics, 2013, 161 (18), pp.2946-2951. ⟨10.1016/j.dam.2013.07.003⟩ Article dans une revue hal-00768472v2
A Complexity Dichotomy for the Coloring of Sparse Graphs Louis Esperet,Mickaël Montassier,Pascal Ochem,Alexandre Pinlou Journal of Graph Theory, 2013, 73 (1), pp.85-102. ⟨10.1002/jgt.21659⟩ Article dans une revue istex lirmm-00736468v1
On Spanning Galaxies in Digraphs Daniel Gonçalves,Frédéric Havet,Alexandre Pinlou,Stéphan Thomassé Discrete Applied Mathematics, 2012, 160 (6), pp.744-754. ⟨10.1016/j.dam.2011.07.013⟩ Article dans une revue hal-00749191v1
Triangle Contact Representations and Duality Daniel Gonçalves,Benjamin Lévêque,Alexandre Pinlou Discrete and Computational Geometry, 2012, 48 (1), pp.239-254. ⟨10.1007/s00454-012-9400-1⟩ Article dans une revue lirmm-00715024v1
The Domination Number of Grids Daniel Gonçalves,Alexandre Pinlou,Michaël Rao,Stéphan Thomassé SIAM Journal on Discrete Mathematics, 2011, 25, pp.1443-1453. ⟨10.1137/11082574⟩ Article dans une revue lirmm-00569256v1
Homomorphisms of 2-edge-colored graphs Amanda Montejano,Pascal Ochem,Alexandre Pinlou,André Raspaud,Eric Sopena Discrete Applied Mathematics, 2010, 158 (12), pp.1365-1379. ⟨10.1016/j.dam.2009.09.017⟩ Article dans une revue istex lirmm-00433039v1
Acyclic improper colourings of graphs with bounded maximum degree Louigi Addario-Berry,Louis Esperet,Ross Kang,Colin Mcdiarmid,Alexandre Pinlou Discrete Mathematics, 2010, 310 (2), pp.223-229. ⟨10.1016/j.disc.2008.09.009⟩ Article dans une revue istex lirmm-00433038v1
An Oriented Coloring of Planar Graphs with Girth at Least Five Alexandre Pinlou Discrete Mathematics, 2009, 309, pp.2108-2118. ⟨10.1016/j.disc.2008.04.030⟩ Article dans une revue istex lirmm-00371599v1
Oriented Colorings of Partial 2-trees Pascal Ochem,Alexandre Pinlou Information Processing Letters, 2008, 108, pp.82-86. ⟨10.1016/j.ipl.2008.04.007⟩ Article dans une revue istex lirmm-00314715v1
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles Mickaël Montassier,Pascal Ochem,Alexandre Pinlou Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.1-24. ⟨10.46298/dmtcs.418⟩ Article dans une revue lirmm-00184811v1
On the Oriented Chromatic Index of Oriented Graphs Pascal Ochem,Alexandre Pinlou,Eric Sopena Journal of Graph Theory, 2008, 57 (4), pp.313-332. ⟨10.1002/jgt.20286⟩ Article dans une revue istex lirmm-00195956v1
The acircuitic directed star arboricity of subcubic graphs is at most four Alexandre Pinlou,Eric Sopena Discrete Mathematics, 2006, 306, pp.3281--3289 Article dans une revue hal-00307095v1
On oriented arc-coloring of subcubic graphs Alexandre Pinlou The Electronic Journal of Combinatorics, 2006, 13, pp.131 Article dans une revue hal-00307094v1
Oriented vertex and arc colorings of outerplanar graphs Alexandre Pinlou,Eric Sopena Information Processing Letters, 2006, 100, pp.97-104 Article dans une revue hal-00307093v1

Communication dans un congrès (18)

The Chromatic Number of Signed Graphs with Bounded Maximum Average Degree Fabien Jacques,Alexandre Pinlou EuroComb 2021 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2021, Barcelone (online), Spain. pp.657-662, ⟨10.1007/978-3-030-83823-2_105⟩ Communication dans un congrès lirmm-04026746v1
r-hued coloring of planar graphs with girth at least 8 Xuan Hoang La,Mickaël Montassier,Alexandre Pinlou,Petru Valicov BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France Communication dans un congrès lirmm-02938645v1
The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degree Fabien Jacques,Mickaël Montassier,Alexandre Pinlou BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France Communication dans un congrès lirmm-02938635v1
On a conjecture on k-Thue sequences Borut Lužar,Martina Mockovčiaková,Pascal Ochem,Alexandre Pinlou,Roman Soták BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France Communication dans un congrès lirmm-01730302v1
La méthode de compression d'entropie appliquée aux colorations de graphes Alexandre Pinlou Journées Graphes et Algorithmes, Nov 2014, Dijon, France Communication dans un congrès lirmm-01377063v1
Partitioning sparse graphs into an independent set and a forest of bounded degree François Dross,Mickaël Montassier,Alexandre Pinlou BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France Communication dans un congrès lirmm-01430813v1
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree François Dross,Mickaël Montassier,Alexandre Pinlou EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.269-275, ⟨10.1016/j.endm.2015.06.037⟩ Communication dans un congrès lirmm-01233461v1
Entropy compression method applied to graph colorings Daniel Gonçalves,Mickaël Montassier,Alexandre Pinlou ICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France Communication dans un congrès lirmm-01233456v1
2-distance coloring of sparse graphs Marthe Bonamy,Benjamin Lévêque,Alexandre Pinlou Eurocomb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.155-160, ⟨10.1016/j.endm.2011.09.027⟩ Communication dans un congrès lirmm-00782852v1
Plate-forme semi-automatique : E-quity Sandra Bringay,Alexandre Pinlou,Sylvain Durand,Sébastien Pro,Patrice Séébold Séminaire national "C2i1 : plan pour la réussite en licence et compétences numériques, Jun 2011, Montpellier, France. 11 p Communication dans un congrès hal-03071401v1
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs Pascal Ochem,Alexandre Pinlou LAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.123-128, ⟨10.1016/j.endm.2011.05.022⟩ Communication dans un congrès lirmm-00530543v1
Triangle Contact Representations and Duality Daniel Gonçalves,Benjamin Lévêque,Alexandre Pinlou 18th International Symposium on Graph Drawing (GD), Sep 2010, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩ Communication dans un congrès istex lirmm-00620728v1
The chromatic number of sparse colored mixed graphs Amanda Montejano,Alexandre Pinlou,André Raspaud,Eric Sopena EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.363-367, ⟨10.1016/j.endm.2009.07.060⟩ Communication dans un congrès hal-00409025v1
Spanning galaxies in digraphs Daniel Gonçalves,Frédéric Havet,Alexandre Pinlou,Stéphan Thomassé EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩ Communication dans un congrès istex lirmm-00433050v1
Homomorphisms of 2-Edge-Colored Graphs Amanda Montejano,Pascal Ochem,Alexandre Pinlou,André Raspaud,Eric Sopena IV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.33-38, ⟨10.1016/j.endm.2008.01.007⟩ Communication dans un congrès istex lirmm-00196757v1
Oriented vertex and arc-colorings of partial 2-trees Pascal Ochem,Alexandre Pinlou Eurocomb07 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2007, Spain. pp.195--199 Communication dans un congrès hal-00307125v1
Strong Oriented Chromatic Number of Planar Graphs without Cycles of Specific Lengths Mickael Montassier,Pascal Ochem,Alexandre Pinlou LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.27-32, ⟨10.1016/j.endm.2008.01.006⟩ Communication dans un congrès istex lirmm-00196741v1
Acyclic improper choosability of graphs Louis Esperet,Alexandre Pinlou CS06 - Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2006, Slovakia. pp.251--258 Communication dans un congrès hal-00307157v1

HDR (1)

Some Problems in Graph Coloring: Methods, Extensions and Results Alexandre Pinlou Discrete Mathematics [cs.DM]. Université montpellier II, 2014 HDR tel-01376199v1