Alexandre Pinlou
Présentation
Publications
Publications
|
|
The Chromatic Number of Signed Graphs with Bounded Maximum Average DegreeEuroComb 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⟩ |
|
|
The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degreeBGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France |
|
|
r-hued coloring of planar graphs with girth at least 8BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France |
On a conjecture on k-Thue sequencesBGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France |
|
La méthode de compression d'entropie appliquée aux colorations de graphesJournées Graphes et Algorithmes, Nov 2014, Dijon, France |
|
|
|
Partitioning sparse graphs into an independent set and a forest of bounded degreeBGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France |
|
|
Partitioning a triangle-free planar graph into a forest and a forest of bounded degreeEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.269-275, ⟨10.1016/j.endm.2015.06.037⟩ |
|
|
Entropy compression method applied to graph coloringsICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France |
|
|
2-distance coloring of sparse graphsEurocomb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.155-160, ⟨10.1016/j.endm.2011.09.027⟩ |
|
|
Plate-forme semi-automatique : E-quitySéminaire national "C2i1 : plan pour la réussite en licence et compétences numériques, Jun 2011, Montpellier, France. 11 p |
|
|
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar GraphsLAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.123-128, ⟨10.1016/j.endm.2011.05.022⟩ |
|
|
Triangle Contact Representations and Duality18th International Symposium on Graph Drawing (GD), Sep 2010, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩ |
|
|
The chromatic number of sparse colored mixed graphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.363-367, ⟨10.1016/j.endm.2009.07.060⟩ |
Spanning galaxies in digraphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩ |
|
Homomorphisms of 2-Edge-Colored GraphsIV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.33-38, ⟨10.1016/j.endm.2008.01.007⟩ |
|
Oriented vertex and arc-colorings of partial 2-treesEurocomb07 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2007, Spain. pp.195--199 |
|
Strong Oriented Chromatic Number of Planar Graphs without Cycles of Specific LengthsLAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile. pp.27-32, ⟨10.1016/j.endm.2008.01.006⟩ |
|
Acyclic improper choosability of graphsCS06 - Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2006, Slovakia. pp.251--258 |
|
|
Some Problems in Graph Coloring: Methods, Extensions and ResultsDiscrete Mathematics [cs.DM]. Université montpellier II, 2014 |