Mickael Montassier

Cited by

	All	Since 2020
Citations	1354	397
h-index	25	12
i10-index	43	16

120

200620072008200920102011201220132014201520162017201820192020202120222023202420259 14 27 50 68 88 60 87 80 78 91 93 101 95 87 78 78 78 67 9

Public access

View all

4 articles

1 article

available

not available

Based on funding mandates

Co-authors

André RaspaudProfessor emeritus, LaBRI, Bordeaux University, FranceVerified email at labri.fr
Alexandre PinlouLIRMM, University of MontpellierVerified email at lirmm.fr
Hervé HocquardLaBRIVerified email at labri.fr
Pascal OchemLIRMM - CNRSVerified email at lirmm.fr
Paul DorbecNormandie Univ, UNICAEN, ENSICAEN, CNRS, GREYC, 14000 Caen, FranceVerified email at unicaen.fr
oleg borodinVerified email at math.nsc.ru
Xuding ZhuZhejiang Normal UniversityVerified email at zjnu.edu.cn
Daniel GonçalvesLIRMM, CNRS, Université de MontpellierVerified email at lirmm.fr
Arnaud PêcherProfessor of Computer Science, University of BordeauxVerified email at u-bordeaux.fr
Anna Olegovna IvanovaНИИ математики; Северо-Восточный федеральный университет имени М.К.АммосоваVerified email at s-vfu.ru
Michael A. HenningProfessor of Mathematics, University of JohannesburgVerified email at uj.ac.za
Roman SotákAsociate Professor of Mathematics, P.J. Šafárik University in KošiceVerified email at upjs.sk
Stanislav JendroľVerified email at upjs.sk
Daniel CranstonAssociate Professor of Computer Science, Virginia Commonwealth UniversityVerified email at vcu.edu
Steven ChaplickAssistant Professor, Maastricht UniversityVerified email at maastrichtuniversity.nl
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerified email at kam.mff.cuni.cz
stephane perennescnrsVerified email at cnrs.fr
Jean-Claude BermondDirecteur de Recherche CNRSVerified email at sophia.inria.fr

Mickael Montassier

University of Montpellier

Verified email at lirmm.fr - Homepage

Graph Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Generalized power domination of graphs GJ Chang, P Dorbec, M Montassier, A Raspaud Discrete Applied Mathematics 160 (12), 1691-1698, 2012	79	2012
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ H Hocquard, M Montassier Journal of Combinatorial Optimization 26 (1), 152-160, 2013	60	2013
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	57	2009
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	55	2012
Entropy compression method applied to graph colorings D Gonçalves, M Montassier, A Pinlou arXiv preprint arXiv:1406.4380, 2014	54	2014
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	52	2010
Near-colorings: non-colorable graphs and NP-completeness M Montassier, P Ochem arXiv preprint arXiv:1306.0752, 2013	43	2013
Star coloring of sparse graphs Y Bu, DW Cranston, M Montassier, A Raspaud, W Wang Journal of Graph Theory 62 (3), 201-219, 2009	41	2009
On the acyclic choosability of graphs M Montassier, P Ochem, A Raspaud Journal of Graph Theory 51 (4), 281-300, 2006	39	2006
(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	39	2006
Linear choosability of graphs L Esperet, M Montassier, A Raspaud Discrete Mathematics 308 (17), 3938-3950, 2008	38	2008
(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	38	2007
Acyclic 4-choosability of planar graphs without cycles of specific lengths M Montassier, A Raspaud, W Wang Topics in Discrete Mathematics, 473-491, 2006	38	2006
On strong edge-colouring of subcubic graphs H Hocquard, M Montassier, A Raspaud, P Valicov Discrete Applied Mathematics 161 (16-17), 2467-2479, 2013	37	2013
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	36	2014
Generalized power domination in regular graphs P Dorbec, MA Henning, C Löwenstein, M Montassier, A Raspaud SIAM Journal on Discrete Mathematics 27 (3), 1559-1574, 2013	36	2013
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	33	2011
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	31*	2014
Bordeaux 3-color conjecture and 3-choosability M Montassier, A Raspaud, W Wang Discrete mathematics 306 (6), 573-579, 2006	31	2006
Acyclic 5‐choosability of planar graphs without small cycles M Montassier, A Raspaud, W Wang Journal of Graph Theory 54 (3), 245-260, 2007	30	2007

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors