Segui
Mickael Montassier
Mickael Montassier
University of Montpellier
Email verificata su lirmm.fr - Home page
Titolo
Citata da
Citata da
Anno
Generalized power domination of graphs
GJ Chang, P Dorbec, M Montassier, A Raspaud
Discrete Applied Mathematics 160 (12), 1691-1698, 2012
752012
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
H Hocquard, M Montassier
Journal of Combinatorial Optimization 26 (1), 152-160, 2013
562013
Planar graphs without 5-and 7-cycles and without adjacent triangles are 3-colorable
OV Borodin, AN Glebov, M Montassier, A Raspaud
Journal of Combinatorial Theory, Series B 99 (4), 668-673, 2009
552009
Entropy compression method applied to graph colorings
D Gonçalves, M Montassier, A Pinlou
arXiv preprint arXiv:1406.4380, 2014
542014
Decomposing a graph into forests
M Montassier, PO de Mendez, A Raspaud, X Zhu
Journal of Combinatorial Theory, Series B 102 (1), 38-52, 2012
482012
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
OV Borodin, AO Ivanova, M Montassier, P Ochem, A Raspaud
Journal of Graph Theory 65 (2), 83-93, 2010
482010
On the acyclic choosability of graphs
M Montassier, P Ochem, A Raspaud
Journal of Graph Theory 51 (4), 281-300, 2006
412006
Acyclic 4-choosability of planar graphs without cycles of specific lengths
M Montassier, A Raspaud, W Wang
Topics in Discrete Mathematics, 473-491, 2006
402006
Near-colorings: non-colorable graphs and NP-completeness
M Montassier, P Ochem
arXiv preprint arXiv:1306.0752, 2013
392013
Star coloring of sparse graphs
Y Bu, DW Cranston, M Montassier, A Raspaud, W Wang
Journal of Graph Theory 62 (3), 201-219, 2009
392009
Linear choosability of graphs
L Esperet, M Montassier, A Raspaud
Discrete Mathematics 308 (17), 3938-3950, 2008
382008
(d, 1)‐total labeling of graphs with a given maximum average degree
M Montassier, A Raspaud
Journal of Graph Theory 51 (2), 93-109, 2006
382006
On strong edge-colouring of subcubic graphs
H Hocquard, M Montassier, A Raspaud, P Valicov
Discrete Applied Mathematics 161 (16-17), 2467-2479, 2013
372013
(d, 1)-total labelling of planar graphs with large girth and high maximum degree
F Bazzaro, M Montassier, A Raspaud
Discrete mathematics 307 (16), 2141-2151, 2007
362007
Generalized power domination in regular graphs
P Dorbec, MA Henning, C Löwenstein, M Montassier, A Raspaud
SIAM Journal on Discrete Mathematics 27 (3), 1559-1574, 2013
352013
Contact representations of planar graphs: extending a partial representation is hard
S Chaplick, P Dorbec, J Kratochvíl, M Montassier, J Stacho
International Workshop on Graph-Theoretic Concepts in Computer Science, 139-151, 2014
332014
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
H Hocquard, M Montassier
Electronic Notes in Discrete Mathematics 38, 457-462, 2011
332011
Acyclic 5‐choosability of planar graphs without small cycles
M Montassier, A Raspaud, W Wang
Journal of Graph Theory 54 (3), 245-260, 2007
322007
Bordeaux 3-color conjecture and 3-choosability
M Montassier, A Raspaud, W Wang
Discrete mathematics 306 (6), 573-579, 2006
322006
Strong chromatic index of planar graphs with large girth
GJ Chang, M Montassier, A Pêcher, A Raspaud
Discussiones Mathematicae Graph Theory 34 (4), 723–733, 2014
292014
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20