The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
Duffy, Christopher, Jacques, Fabien, Montassier, Mickaël, Pinlou, Alexandre
Published in Discrete mathematics (01.10.2023)
Published in Discrete mathematics (01.10.2023)
Get full text
Journal Article
Acyclic coloring of graphs and entropy compression method
Gonçalves, Daniel, Montassier, Mickael, Pinlou, Alexandre
Published in Discrete mathematics (01.04.2020)
Published in Discrete mathematics (01.04.2020)
Get full text
Journal Article
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
Dross, François, Montassier, Mickael, Pinlou, Alexandre
Published in European journal of combinatorics (01.12.2017)
Published in European journal of combinatorics (01.12.2017)
Get full text
Journal Article
Large induced forests in planar graphs with girth 4
Dross, François, Montassier, Mickael, Pinlou, Alexandre
Published in Discrete Applied Mathematics (15.02.2019)
Published in Discrete Applied Mathematics (15.02.2019)
Get full text
Journal Article
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
Dross, François, Montassier, Mickael, Pinlou, Alexandre
Published in Discrete mathematics (01.04.2019)
Published in Discrete mathematics (01.04.2019)
Get full text
Journal Article
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9
La, Hoang, Montassier, Mickael, Pinlou, Alexandre, Valicov, Petru
Published in European journal of combinatorics (01.01.2021)
Published in European journal of combinatorics (01.01.2021)
Get full text
Journal Article
A lower bound on the order of the largest induced forest in planar graphs with high girth
Dross, François, Montassier, Mickael, Pinlou, Alexandre
Published in Discrete Applied Mathematics (11.12.2016)
Published in Discrete Applied Mathematics (11.12.2016)
Get full text
Journal Article
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree
Dross, François, Montassier, Mickael, Pinlou, Alexandre
Published in The Electronic journal of combinatorics (02.03.2018)
Published in The Electronic journal of combinatorics (02.03.2018)
Get full text
Journal Article
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
Hocquard, Hervé, Montassier, Mickaël
Published in Journal of combinatorial optimization (01.07.2013)
Published in Journal of combinatorial optimization (01.07.2013)
Get full text
Journal Article
A Complexity Dichotomy for the Coloring of Sparse Graphs
Esperet, Louis, Montassier, Mickaël, Ochem, Pascal, Pinlou, Alexandre
Published in Journal of graph theory (01.05.2013)
Published in Journal of graph theory (01.05.2013)
Get full text
Journal Article
On strong edge-colouring of subcubic graphs
Hocquard, Hervé, Montassier, Mickaël, Raspaud, André, Valicov, Petru
Published in Discrete Applied Mathematics (01.11.2013)
Published in Discrete Applied Mathematics (01.11.2013)
Get full text
Journal Article
Independent Domination in Cubic Graphs
Dorbec, Paul, Henning, Michael A., Montassier, Mickael, Southey, Justin
Published in Journal of graph theory (01.12.2015)
Published in Journal of graph theory (01.12.2015)
Get full text
Journal Article
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
Dross, Franois, Montassier, Mickael, Pinlou, Alexandre
Published in Electronic notes in discrete mathematics (01.11.2015)
Published in Electronic notes in discrete mathematics (01.11.2015)
Get full text
Journal Article
3-Paths in Graphs with Bounded Average Degree
Jendrol, Stanislav, Maceková, Mária, Montassier, Mickaël, Soták, Roman
Published in Discussiones Mathematicae. Graph Theory (01.05.2016)
Published in Discussiones Mathematicae. Graph Theory (01.05.2016)
Get full text
Journal Article
( d , 1 ) -total labelling of planar graphs with large girth and high maximum degree
Bazzaro, Fabrice, Montassier, Mickaël, Raspaud, André
Published in Discrete mathematics (28.07.2007)
Published in Discrete mathematics (28.07.2007)
Get full text
Journal Article