| 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 | Jaroslav Nesetril, André Raspaud |
Preface. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, André Raspaud, Weifan Wang |
Vertex-arboricity of planar graphs without intersecting triangles. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, André Raspaud |
A sufficient condition for planar graphs to be acyclically 5-choosable. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Li-Da Tong |
The minimum identifying code graphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud |
On the size of identifying codes in triangle-free graphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Xuding Zhu |
Circular flow on signed graphs. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary MacGillivray, André Raspaud, Jacobus Swarts |
Obstructions to Injective Oriented Colourings. |
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 | Chao Li, Weifan Wang, André Raspaud |
Upper bounds on the linear chromatic number of a graph. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu |
Acyclic 4-choosability of planar graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, André Raspaud, Weifan Wang |
8-star-choosability of a graph with maximum average degree less than 3. |
Discrete Mathematics & Theoretical Computer Science |
2011 |
DBLP 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 | Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu |
Short cycle covers of graphs and nowhere-zero flows. |
Journal of Graph Theory |
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 | Min Chen, André Raspaud |
On acyclic 4-choosability of planar graphs without short cycles. |
Discrete Mathematics |
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 | Min Chen, André Raspaud |
Homomorphisms from sparse graphs to the Petersen graph. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Alexei N. Glebov, André Raspaud |
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. |
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 | Alain Doyon, Gena Hahn, André Raspaud |
Some bounds on the injective chromatic number of graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, M. Chen, Anna O. Ivanova, André Raspaud |
Acyclic 3-choosability of sparse graphs with girth at least 7. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Anna O. Ivanova, André Raspaud |
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Kaiser, André Raspaud |
Perfect matchings with restricted intersection in cubic graphs. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud |
On the size of identifying codes in triangle-free graphs |
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 | Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena |
Homomorphisms of 2-edge-colored 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 | Min Chen, André Raspaud |
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiaojiao Wu, André Raspaud |
Game chromatic number of toroidal grids. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amanda Montejano, Alexandre Pinlou, André Raspaud, Eric Sopena |
Chromatic number of sparse colored mixed planar graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslav Nesetril, André Raspaud |
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Jiaojiao Wu |
Game chromatic number of toroidal grids. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Delmas, André Raspaud |
Preface. |
Discrete Mathematics |
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 | André Raspaud, Weifan Wang |
Linear coloring of planar graphs with large girth. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto |
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera |
Projective, affine, and abelian colorings of cubic graphs. |
Eur. J. Comb. |
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 | Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang |
Injective coloring of planar graphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary MacGillivray, André Raspaud, Jacobus Swarts |
Injective Oriented Colourings. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena |
Homomorphisms of 2-edge-colored graphs. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
Acyclic coloring of graphs of maximum degree five: Nine colors are enough. |
Inf. Process. Lett. |
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 | André Raspaud, Weifan Wang |
On the vertex-arboricity of planar graphs. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, André Raspaud, Juraj Stacho |
On Injective Colourings of Chordal Graphs. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Kaiser, André Raspaud |
Non-intersecting perfect matchings in cubic graphs (Extended abstract). |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Nicolas Roussel |
Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, André Raspaud, Weifan Wang |
Three-coloring planar graphs without short cycles. |
Inf. Process. Lett. |
2007 |
DBLP DOI 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 | Guillaume Fertin, André Raspaud |
L(p, q) labeling of d-dimensional grids. |
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 | André Raspaud, Xuding Zhu |
List circular coloring of trees and 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, 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 | Edita Mácajová, André Raspaud |
On the strong circular 5-flow conjecture. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour |
Planar graphs without cycles of length from 4 to 7 are 3-colorable. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Edita Mácajová, André Raspaud, Martin Skoviera |
Abelian Colourings of Cubic Graphs. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt DeVos, Jaroslav Nesetril, André Raspaud |
Antisymmetric flows and edge-connectivity. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Bruce A. Reed |
Star coloring of graphs. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
A survey on Knödel graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Ondrej Sýkora |
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. |
SIROCCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, André Raspaud |
A sufficient condition for planar graphs to be 3-colorable. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Arup Roychowdhury |
On the oriented chromatic number of grids. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, Emmanuel Godard, André Raspaud |
Acyclic and k-distance coloring of the grid. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesc Comellas, Guillaume Fertin, André Raspaud |
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. |
SIROCCO |
2003 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena |
Nilpotent Families of Endomorphisms of (p(V)+, cup). |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, Emmanuel Godard, André Raspaud |
Minimum feedback vertex set and acyclic coloring. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena |
On Deeply Critical Oriented Graphs. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
Neighborhood Communications in Networks. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Denise Amar, André Raspaud, Olivier Togni |
All-to-all wavelength-routing in all-optical compound networks. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena |
On nice graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Eric Sopena |
Acyclic colouring of 1-planar graphs. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Bruce A. Reed |
On Star Coloring of Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring |
| 1 | Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena |
Small k-Dominating Sets in Planar Graphs with Applications. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
k-Neighborhood Broadcasting. |
SIROCCO |
2001 |
DBLP BibTeX RDF |
|
| 1 | Jaroslav Nesetril, André Raspaud |
Colored Homomorphisms of Colored Mixed Graphs. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
Recognizing Recursive Circulant Graphs (Extended Abstract). |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Diameter of the Knödel Graph. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Ondrej Sýkora, Imrich Vrto |
Congestion and dilation, similarities and differences: A survey. |
SIROCCO |
2000 |
DBLP BibTeX RDF |
|
| 1 | Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena |
On the maximum average degree and the oriented chromatic number of a graph. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Gavoille, Jean-Claude Bermond, André Raspaud (eds.) |
SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999 |
SIROCCO |
1999 |
DBLP BibTeX RDF |
|
| 1 | Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena |
On universal graphs for planar oriented graphs of a given girth. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud |
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. |
IEEE Trans. Parallel Distrib. Syst. |
1998 |
DBLP DOI BibTeX RDF |
multicasting, Broadcasting, wormhole, circuit-switched networks |
| 1 | Guillaume Fertin, André Raspaud |
Families of Graphs Having Broadcasting and Gossiping Properties. |
WG |
1998 |
DBLP DOI BibTeX RDF |
minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs |
| 1 | Ginette Gauyacq, C. Micheneau, André Raspaud |
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jarik Nesetril, André Raspaud, Eric Sopena |
Colorings and girth of oriented planar graphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Roger Labahn, André Raspaud |
Periodic Gossiping in Back-to-back Trees. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud |
Broadcasting and Multicasting in Cut-through Routed Networks. (PDF / PS) |
IPPS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar Ordaz, Denise Amar, André Raspaud |
Hamiltonian properties and the bipartite independence number. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Ondrej Sýkora, Imrich Vrto |
Cutwidth of the Bruijn Graph. |
ITA |
1995 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")