|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 36 publication records. Showing 36 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu |
Decomposing a graph into forests.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud |
On backbone coloring of graphs. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, Mickaël Montassier, André Raspaud |
Some structural properties of planar graphs and their applications to 3-choosability. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud |
(k, 1)-coloring of sparse graphs. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Hocquard, Mickaël Montassier |
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément Charpentier, Mickaël Montassier, André Raspaud |
Minmax degree of graphs (Extended abstract). |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau |
On two variations of identifying codes. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Kaiser, Mickaël Montassier, André Raspaud |
Covering a Graph by Forests and a Matching. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud |
(k, j)-coloring of sparse graphs. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud, Xuding Zhu |
Decomposition of sparse graphs into two forests, one having bounded maximum degree. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu |
Decomposition of sparse graphs, with application to game coloring number. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Mickaël Montassier, André Raspaud |
Planar graphs without adjacent cycles of length at most seven are 3-colorable. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau |
Locally identifying coloring of graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau |
On two variations of identifying codes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud |
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Hocquard, Mickaël Montassier, André Raspaud |
A note on the acyclic 3-choosability of some planar graphs. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud |
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Hocquard, Mickaël Montassier |
Acyclic choosability of planar graphs: a Steinberg like approach. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Hocquard, Mickaël Montassier |
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud |
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud, Xuding Zhu |
An upper bound on adaptable choosability of graphs. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang |
Star coloring of sparse graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Esperet, Mickaël Montassier, Xuding Zhu |
Adapted list coloring of planar graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, Pascal Ochem, Alexandre Pinlou |
Strong oriented chromatic number of planar graphs without cycles of specific lengths. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang |
A relaxation of Havel's 3-color problem. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Esperet, Mickaël Montassier, André Raspaud |
Linear choosability of graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, Pascal Ochem, Alexandre Pinlou |
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. |
Discrete Mathematics & Theoretical Computer Science |
2008 |
DBLP BibTeX RDF |
|
| 1 | Fabrice Bazzaro, Mickaël Montassier, André Raspaud |
(d, 1)-total labelling of planar graphs with large girth and high maximum degree. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier |
A small non-Z4-colorable planar graph. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud, Weifan Wang |
Acyclic 5-choosability of planar graphs without small cycles. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud |
A note on 2-facial coloring of plane graphs. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier |
A note on the not 3-choosability of some families of planar graphs. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud, Weifan Wang |
Bordeaux 3-color conjecture and 3-choosability. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud |
(d, 1)-total labeling of graphs with a given maximum average degree. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, Pascal Ochem, André Raspaud |
On the acyclic choosability of graphs. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gonçalves, Mickaël Montassier |
Acyclic Choosability of Graphs with Small Maximum Degree. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #36 of 36 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")