default search action
Alexandre Pinlou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j43]Christopher Duffy
, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. Discret. Math. 346(10): 113579 (2023) - 2022
- [j42]Fabien Jacques
The chromatic number of signed graphs with bounded maximum average degree. Discret. Appl. Math. 316: 43-59 (2022) - 2021
- [j41]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. Eur. J. Comb. 91: 103219 (2021) - [i18]Fabien Jacques, Alexandre Pinlou:
The chromatic number of signed graphs with bounded maximum average degree. CoRR abs/2104.11121 (2021) - 2020
- [j40]Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. 279: 106-117 (2020) - [j39]Daniel Gonçalves
Acyclic coloring of graphs and entropy compression method. Discret. Math. 343(4): 111772 (2020) - [j38]Janusz Dybizbanski
Oriented cliques and colorings of graphs with low maximum degree. Discret. Math. 343(5): 111829 (2020) - [i17]Christopher Duffy, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou:
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. CoRR abs/2009.05439 (2020)
2010 – 2019
- 2019
- [j37]François Dross, Mickaël Montassier, Alexandre Pinlou:
Large induced forests in planar graphs with girth 4. Discret. Appl. Math. 254: 96-106 (2019) - [j36]François Dross
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discret. Math. 342(4): 943-950 (2019) - [i16]Pascal Ochem, Alexandre Pinlou:
Oriented coloring of graphs with low maximum degree. CoRR abs/1905.12484 (2019) - [i15]Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou:
Homothetic triangle representations of planar graphs. CoRR abs/1908.11749 (2019) - 2018
- [j35]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. Electron. J. Comb. 25(1): 1 (2018) - [j34]Borut Luzar, Pascal Ochem, Alexandre Pinlou:
On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. Electron. J. Comb. 25(1): 1 (2018) - 2017
- [j33]Marthe Bonamy, Martin Knor, Borut Luzar
On the difference between the Szeged and the Wiener index. Appl. Math. Comput. 312: 202-213 (2017) - [j32]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Eur. J. Comb. 66: 81-94 (2017) - [j31]Pascal Ochem, Alexandre Pinlou, Sagnik Sen:
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. J. Graph Theory 85(1): 258-277 (2017) - [i14]Borut Luzar, Pascal Ochem, Alexandre Pinlou:
On repetition thresholds of caterpillars and trees of bounded degree. CoRR abs/1702.01058 (2017) - [i13]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. CoRR abs/1705.11133 (2017) - 2016
- [j30]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. Discret. Appl. Math. 214: 99-107 (2016) - [j29]Marthe Bonamy
Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable. Discret. Math. Theor. Comput. Sci. 17(3): 131-146 (2016) - [i12]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. CoRR abs/1601.01523 (2016) - [i11]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning sparse graphs into an independent set and a forest of bounded degree. CoRR abs/1606.04394 (2016) - 2015
- [j28]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Electron. Notes Discret. Math. 49: 269-275 (2015) - [i10]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. CoRR abs/1504.01949 (2015) - 2014
- [b1]Alexandre Pinlou:
Some Problems in Graph Coloring: Methods, Extensions and Results. Montpellier 2 University, France, 2014 - [j27]Pascal Ochem, Alexandre Pinlou:
Application of Entropy Compression in Pattern Avoidance. Electron. J. Comb. 21(2): 2 (2014) - [j26]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. Discret. Math. 317: 19-32 (2014) - [j25]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
List coloring the square of sparse graphs with large degree. Eur. J. Comb. 41: 128-137 (2014) - [j24]Pascal Ochem, Alexandre Pinlou:
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Graphs Comb. 30(2): 439-453 (2014) - [j23]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-Distance Coloring of Sparse Graphs. J. Graph Theory 77(3): 190-218 (2014) - [i9]Pascal Ochem, Alexandre Pinlou, Sagnik Sen:
Homomorphisms of signed planar graphs. CoRR abs/1401.3308 (2014) - [i8]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C4 are minimally edge and total choosable. CoRR abs/1405.3422 (2014) - [i7]Daniel Gonçalves
Entropy compression method applied to graph colorings. CoRR abs/1406.4380 (2014) - [i6]François Dross, Mickaël Montassier, Alexandre Pinlou:
Large induced forests in planar graphs with girth 4 or 5. CoRR abs/1409.1348 (2014) - 2013
- [j22]Daniel Gonçalves
Locally identifying coloring in bounded expansion classes of graphs. Discret. Appl. Math. 161(18): 2946-2951 (2013) - [j21]Louis Esperet
A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory 73(1): 85-102 (2013) - [i5]Pascal Ochem, Alexandre Pinlou:
Application of entropy compression in pattern avoidance. CoRR abs/1301.1873 (2013) - [i4]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. CoRR abs/1301.7090 (2013) - [i3]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
List coloring the square of sparse graphs with large degree. CoRR abs/1308.4197 (2013) - 2012
- [j20]Daniel Gonçalves
On spanning galaxies in digraphs. Discret. Appl. Math. 160(6): 744-754 (2012) - [j19]Daniel Gonçalves
Triangle Contact Representations and Duality. Discret. Comput. Geom. 48(1): 239-254 (2012) - [i2]Daniel Gonçalves
Locally identifying coloring in bounded expansion classes of graphs. CoRR abs/1212.5468 (2012) - 2011
- [j18]Pascal Ochem, Alexandre Pinlou:
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Electron. Notes Discret. Math. 37: 123-128 (2011) - [j17]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-distance coloring of sparse graphs. Electron. Notes Discret. Math. 38: 155-160 (2011) - [j16]Daniel Gonçalves
The Domination Number of Grids. SIAM J. Discret. Math. 25(3): 1443-1453 (2011) - [i1]Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé:
The Domination Number of Grids. CoRR abs/1102.5206 (2011) - 2010
- [j15]Amanda Montejano
Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. 158(12): 1365-1379 (2010) - [j14]Louigi Addario-Berry, Louis Esperet
Acyclic improper colourings of graphs with bounded maximum degree. Discret. Math. 310(2): 223-229 (2010) - [c1]Daniel Gonçalves
Triangle Contact Representations and Duality. GD 2010: 262-273
2000 – 2009
- 2009
- [j13]Alexandre Pinlou:
An oriented coloring of planar graphs with girth at least five. Discret. Math. 309(8): 2108-2118 (2009) - [j12]Daniel Gonçalves
Spanning galaxies in digraphs. Electron. Notes Discret. Math. 34: 139-143 (2009) - [j11]Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena:
Chromatic number of sparse colored mixed planar graphs. Electron. Notes Discret. Math. 34: 363-367 (2009) - 2008
- [j10]Mickaël Montassier, Pascal Ochem
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - [j9]Mickaël Montassier, Pascal Ochem, Alexandre Pinlou:
Strong oriented chromatic number of planar graphs without cycles of specific lengths. Electron. Notes Discret. Math. 30: 27-32 (2008) - [j8]Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena:
Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. 30: 33-38 (2008) - [j7]Pascal Ochem, Alexandre Pinlou:
Oriented colorings of partial 2-trees. Inf. Process. Lett. 108(2): 82-86 (2008) - [j6]Pascal Ochem, Alexandre Pinlou, Éric Sopena:
On the oriented chromatic index of oriented graphs. J. Graph Theory 57(4): 313-332 (2008) - 2007
- [j5]Louis Esperet
Acyclic improper choosability of graphs. Electron. Notes Discret. Math. 28: 251-258 (2007) - [j4]Pascal Ochem, Alexandre Pinlou:
Oriented vertex and arc colorings of partial 2-trees. Electron. Notes Discret. Math. 29: 195-199 (2007) - 2006
- [j3]Alexandre Pinlou:
On Oriented Arc-Coloring of Subcubic Graphs. Electron. J. Comb. 13(1) (2006) - [j2]Alexandre Pinlou, Éric Sopena:
The acircuitic directed star arboricity of subcubic graphs is at most four. Discret. Math. 306(24): 3281-3289 (2006) - [j1]Alexandre Pinlou, Éric Sopena:
Oriented vertex and arc colorings of outerplanar graphs. Inf. Process. Lett. 100(3): 97-104 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: