André Raspaud

149 papers B 12Journal 134Unranked 2
YearRankTypeTitle / Venue / Authors
2023 J jnl
An (
Discret. Math.
Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu
2022 J jnl
An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6.
J. Graph Theory
Min Chen, André Raspaud, Weiqiang Yu
2022 J jnl
Injective edge-coloring of subcubic graphs.
Discret. Math. Algorithms Appl.
Baya Ferdjallah, Samia Kerdjoudj, André Raspaud
2021 J jnl
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree.
Graphs Comb.
Alexandr V. Kostochka, André Raspaud, Bjarne Toft, Douglas B. West, Dara Zirlin
2021 J jnl
Injective edge-coloring of graphs with given maximum degree.
Eur. J. Comb.
Alexandr V. Kostochka, André Raspaud, Jingwei Xu
2021 J jnl
On star edge colorings of bipartite and subcubic graphs.
Discret. Appl. Math.
Carl Johan Casselgren, Jonas B. Granholm, André Raspaud
2020 J jnl
Choosability with separation of planar graphs without prescribed cycles.
Appl. Math. Comput.
Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang
2019 J jnl
Acyclic improper choosability of subcubic graphs.
Appl. Math. Comput.
Min Chen, André Raspaud
2019 J jnl
List star edge-coloring of k-degenerate graphs and K4-minor free graphs.
Discret. Appl. Math.
Samia Kerdjoudj, André Raspaud
2019 J jnl
Oriented incidence colourings of digraphs.
Discuss. Math. Graph Theory
Christopher Duffy, Gary MacGillivray, Pascal Ochem, André Raspaud
2018 J jnl
List star chromatic index of sparse graphs.
Discret. Math.
Samia Kerdjoudj, Kavita Pradeep, André Raspaud
2018 J jnl
List star edge coloring of sparse graphs.
Discret. Appl. Math.
Samia Kerdjoudj, André Raspaud
2018 J jnl
List star edge-coloring of subcubic graphs.
Discuss. Math. Graph Theory
Samia Kerdjoudj, Alexandr V. Kostochka, André Raspaud
2018 J jnl
Strong edge-colorings of sparse graphs with large maximum degree.
Eur. J. Comb.
Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud
2017 J jnl
Incidence coloring of graphs with high maximum average degree.
Discret. Appl. Math.
Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
2017 J jnl
On weight choosabilities of graphs with bounded maximum average degree.
Discret. Appl. Math.
Jakub Przybylo, André Raspaud, Mariusz Wozniak
2016 J jnl
A (3, 1) ∗-choosable theorem on planar graphs.
J. Comb. Optim.
Min Chen, André Raspaud, Weifan Wang
2016 J jnl
Circuit Covers of Signed Graphs.
J. Graph Theory
Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera
2016 J jnl
The Chromatic Number of a Signed Graph.
Electron. J. Comb.
Edita Mácajová, André Raspaud, Martin Skoviera
2015 J jnl
Planar graphs with girth at least 5 are (3, 5)-colorable.
Discret. Math.
Ilkyoo Choi, André Raspaud
2014 J jnl
Incidence coloring of graphs with high maximum average degree.
CoRR
Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
2014 J jnl
Limits of Near-Coloring of Sparse Graphs.
J. Graph Theory
Paul Dorbec, Tomás Kaiser, Mickaël Montassier, André Raspaud
2014 J jnl
Obstructions to locally injective oriented improper colourings.
Eur. J. Comb.
Gary MacGillivray, André Raspaud, Jacobus Swarts
2014 J jnl
On (3, 2)*-choosability of planar graphs without adjacent short cycles.
Discret. Appl. Math.
Min Chen, André Raspaud
2014 J jnl
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable.
Graphs Comb.
Min Chen, André Raspaud, Weifan Wang
2014 J jnl
Star list chromatic number of planar subcubic graphs.
J. Comb. Optim.
Min Chen, André Raspaud, Weifan Wang
2014 J jnl
Strong chromatic index of planar graphs with large girth.
Discuss. Math. Graph Theory
Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud
2013 J jnl
(3, 1)*-choosability of planar graphs without adjacent short cycles.
Electron. Notes Discret. Math.
Min Chen, André Raspaud
2013 J jnl
6-Star-Coloring of Subcubic Graphs.
J. Graph Theory
Min Chen, André Raspaud, Weifan Wang
2013 J jnl
Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 (2012) 685-687].
Eur. J. Comb.
Jaroslav Nesetril, André Raspaud
2013 J jnl
Generalized Power Domination in Regular Graphs.
SIAM J. Discret. Math.
Paul Dorbec, Michael A. Henning, Christian Löwenstein, Mickaël Montassier, André Raspaud
2013 J jnl
L(p, q)-labeling of sparse graphs.
J. Comb. Optim.
Clément Charpentier, Mickaël Montassier, André Raspaud
2013 J jnl
On strong edge-colouring of subcubic graphs.
Discret. Appl. Math.
Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov
2013 J jnl
Planar graphs without 4- and 5-cycles are acyclically 4-choosable.
Discret. Appl. Math.
Min Chen, André Raspaud
2012 J jnl
(k, 1)-coloring of sparse graphs.
Discret. Math.
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
2012 J jnl
A sufficient condition for planar graphs to be acyclically 5-choosable.
J. Graph Theory
Min Chen, André Raspaud
2012 J jnl
Decomposing a graph into forests.
J. Comb. Theory B
Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu
2012 J jnl
Generalized power domination of graphs.
Discret. Appl. Math.
Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud
2012 J jnl
On backbone coloring of graphs.
J. Comb. Optim.
Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
2012 J jnl
On the size of identifying codes in triangle-free graphs.
Discret. Appl. Math.
Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
2012 J jnl
Preface.
Eur. J. Comb.
Jaroslav Nesetril, André Raspaud
2012 J jnl
Some results on the injective chromatic number of graphs.
J. Comb. Optim.
Min Chen, Gena Hahn, André Raspaud, Weifan Wang
2012 J jnl
Some structural properties of planar graphs and their applications to 3-choosability.
Discret. Math.
Min Chen, Mickaël Montassier, André Raspaud
2012 J jnl
The minimum identifying code graphs.
Discret. Appl. Math.
André Raspaud, Li-Da Tong
2012 J jnl
Upper k-tuple domination in graphs.
Discret. Math. Theor. Comput. Sci.
Gerard Jennhwa Chang, Paul Dorbec, Hye Kyung Kim, André Raspaud, Haichao Wang, Weiliang Zhao
2012 J jnl
Vertex-arboricity of planar graphs without intersecting triangles.
Eur. J. Comb.
Min Chen, André Raspaud, Weifan Wang
2011 J jnl
(k, j)-coloring of sparse graphs.
Discret. Appl. Math.
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
2011 J jnl
8-star-choosability of a graph with maximum average degree less than 3.
Discret. Math. Theor. Comput. Sci.
Min Chen, André Raspaud, Weifan Wang
2011 J jnl
Acyclic 4-choosability of planar graphs.
Discret. Math.
Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu
2011 J jnl
Circular flow on signed graphs.
J. Comb. Theory B
André Raspaud, Xuding Zhu
2011 J jnl
Covering a Graph by Forests and a Matching.
SIAM J. Discret. Math.
Tomás Kaiser, Mickaël Montassier, André Raspaud
2011 J jnl
Minmax degree of graphs (Extended abstract).
Electron. Notes Discret. Math.
Clément Charpentier, Mickaël Montassier, André Raspaud
2011 J jnl
Obstructions to Injective Oriented Colourings.
Electron. Notes Discret. Math.
Gary MacGillivray, André Raspaud, Jacobus Swarts
2011 J jnl
Short cycle covers of graphs and nowhere-zero flows.
J. Graph Theory
Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu
2011 J jnl
Upper bounds on the linear chromatic number of a graph.
Discret. Math.
Chao Li, Weifan Wang, André Raspaud
2010 J jnl
A note on the acyclic 3-choosability of some planar graphs.
Discret. Appl. Math.
Hervé Hocquard, Mickaël Montassier, André Raspaud
2010 J jnl
Acyclic 3-choosability of sparse graphs with girth at least 7.
Discret. Math.
Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud
2010 J jnl
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles.
Discret. Math.
Oleg V. Borodin, Anna O. Ivanova, André Raspaud
2010 J jnl
Decomposition of sparse graphs into two forests, one having bounded maximum degree.
Inf. Process. Lett.
Mickaël Montassier, André Raspaud, Xuding Zhu
2010 J jnl
Decomposition of sparse graphs, with application to game coloring number.
Discret. Math.
Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu
2010 J jnl
Homomorphisms from sparse graphs to the Petersen graph.
Discret. Math.
Min Chen, André Raspaud
2010 J jnl
Homomorphisms of 2-edge-colored graphs.
Discret. Appl. Math.
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
2010 J jnl
On acyclic 4-choosability of planar graphs without short cycles.
Discret. Math.
Min Chen, André Raspaud
2010 J jnl
On the size of identifying codes in triangle-free graphs
CoRR
Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
2010 J jnl
Perfect matchings with restricted intersection in cubic graphs.
Eur. J. Comb.
Tomás Kaiser, André Raspaud
2010 J jnl
Planar graphs without adjacent cycles of length at most seven are 3-colorable.
Discret. Math.
Oleg V. Borodin, Mickaël Montassier, André Raspaud
2010 J jnl
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable.
Discret. Math.
Oleg V. Borodin, Alexei N. Glebov, André Raspaud
2010 J jnl
Some bounds on the injective chromatic number of graphs.
Discret. Math.
Alain Doyon, Gena Hahn, André Raspaud
2010 J jnl
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most
J. Graph Theory
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud
2009 J jnl
An upper bound on adaptable choosability of graphs.
Eur. J. Comb.
Mickaël Montassier, André Raspaud, Xuding Zhu
2009 J jnl
Antibandwidth and cyclic antibandwidth of meshes and hypercubes.
Discret. Math.
André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto
2009 J jnl
Chromatic number of sparse colored mixed planar graphs.
Electron. Notes Discret. Math.
Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena
2009 J jnl
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009).
Electron. Notes Discret. Math.
Jaroslav Nesetril, André Raspaud
2009 J jnl
Game chromatic number of toroidal grids.
Electron. Notes Discret. Math.
Jiaojiao Wu, André Raspaud
2009 J jnl
Game chromatic number of toroidal grids.
Inf. Process. Lett.
André Raspaud, Jiaojiao Wu
2009 B conf
Injective Oriented Colourings.
WG
Gary MacGillivray, André Raspaud, Jacobus Swarts
2009 J jnl
Injective coloring of planar graphs.
Discret. Appl. Math.
Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang
2009 J jnl
Linear coloring of planar graphs with large girth.
Discret. Math.
André Raspaud, Weifan Wang
2009 J jnl
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.
Discret. Math.
Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
2009 J jnl
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable.
Electron. Notes Discret. Math.
Min Chen, André Raspaud
2009 J jnl
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.
J. Comb. Theory B
Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud
2009 J jnl
Preface.
Discret. Math.
Olivier Delmas, André Raspaud
2009 J jnl
Projective, affine, and abelian colorings of cubic graphs.
Eur. J. Comb.
Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera
2009 J jnl
Star coloring of sparse graphs.
J. Graph Theory
Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang
2008 J jnl
A relaxation of Havel's 3-color problem.
Inf. Process. Lett.
Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang
2008 J jnl
Acyclic coloring of graphs of maximum degree five: Nine colors are enough.
Inf. Process. Lett.
Guillaume Fertin, André Raspaud
2008 J jnl
Homomorphisms of 2-edge-colored graphs.
Electron. Notes Discret. Math.
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
2008 J jnl
Linear choosability of graphs.
Discret. Math.
Louis Esperet, Mickaël Montassier, André Raspaud
2008 B conf
On Injective Colourings of Chordal Graphs.
LATIN
Pavol Hell, André Raspaud, Juraj Stacho
2008 J jnl
On the vertex-arboricity of planar graphs.
Eur. J. Comb.
André Raspaud, Weifan Wang
2007 J jnl
(d, 1)-total labelling of planar graphs with large girth and high maximum degree.
Discret. Math.
Fabrice Bazzaro, Mickaël Montassier, André Raspaud
2007 J jnl
Acyclic 5-choosability of planar graphs without small cycles.
J. Graph Theory
Mickaël Montassier, André Raspaud, Weifan Wang
2007 J jnl
Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract.
Electron. Notes Discret. Math.
André Raspaud, Nicolas Roussel
2007 J jnl
L(p, q) labeling of d-dimensional grids.
Discret. Math.
Guillaume Fertin, André Raspaud
2007 J jnl
List circular coloring of trees and cycles.
J. Graph Theory
André Raspaud, Xuding Zhu
2007 J jnl
Non-intersecting perfect matchings in cubic graphs (Extended abstract).
Electron. Notes Discret. Math.
Tomás Kaiser, André Raspaud
2007 — conf
On Oriented Labelling Parameters.
Formal Models, Languages and Applications
Daniel Gonçalves, André Raspaud, M. A. Shalu
2007 J jnl
Three-coloring planar graphs without short cycles.
Inf. Process. Lett.
Min Chen, André Raspaud, Weifan Wang
2006 J jnl
(
J. Graph Theory
Mickaël Montassier, André Raspaud
2006 J jnl
A note on 2-facial coloring of plane graphs.
Inf. Process. Lett.
Mickaël Montassier, André Raspaud
2006 J jnl
Bordeaux 3-color conjecture and 3-choosability.
Discret. Math.
Mickaël Montassier, André Raspaud, Weifan Wang
2006 J jnl
On the acyclic choosability of graphs.
J. Graph Theory
Mickaël Montassier, Pascal Ochem, André Raspaud
2006 J jnl
On the strong circular 5-flow conjecture.
J. Graph Theory
Edita Mácajová, André Raspaud
2005 J jnl
Abelian Colourings of Cubic Graphs.
Electron. Notes Discret. Math.
Edita Mácajová, André Raspaud, Martin Skoviera
2005 J jnl
Planar graphs without cycles of length from 4 to 7 are 3-colorable.
J. Comb. Theory B
Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour
2004 J jnl
A survey on Knödel graphs.
Discret. Appl. Math.
Guillaume Fertin, André Raspaud
2004 J jnl
Antisymmetric flows and edge-connectivity.
Discret. Math.
Matt DeVos, Jaroslav Nesetril, André Raspaud
2004 B conf
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes.
SIROCCO
Guillaume Fertin, André Raspaud, Ondrej Sýkora
2004 J jnl
Star coloring of graphs.
J. Graph Theory
Guillaume Fertin, André Raspaud, Bruce A. Reed
2003 J jnl
A sufficient condition for planar graphs to be 3-colorable.
J. Comb. Theory B
Oleg V. Borodin, André Raspaud
2003 J jnl
Acyclic and k-distance coloring of the grid.
Inf. Process. Lett.
Guillaume Fertin, Emmanuel Godard, André Raspaud
2003 J jnl
On the oriented chromatic number of grids.
Inf. Process. Lett.
Guillaume Fertin, André Raspaud, Arup Roychowdhury
2003 B conf
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs.
SIROCCO
Francesc Comellas, Guillaume Fertin, André Raspaud
2002 J jnl
Acyclic list 7-coloring of planar graphs.
J. Graph Theory
Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2002 J jnl
Minimum feedback vertex set and acyclic coloring.
Inf. Process. Lett.
Guillaume Fertin, Emmanuel Godard, André Raspaud
2002 J jnl
Nilpotent Families of Endomorphisms of (p(V)+, cup).
J. Comb. Theory B
Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
2001 J jnl
Acyclic colouring of 1-planar graphs.
Discret. Appl. Math.
Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001 J jnl
All-to-all wavelength-routing in all-optical compound networks.
Discret. Math.
Denise Amar, André Raspaud, Olivier Togni
2001 J jnl
Neighborhood Communications in Networks.
Electron. Notes Discret. Math.
Guillaume Fertin, André Raspaud
2001 J jnl
On Deeply Critical Oriented Graphs.
J. Comb. Theory B
Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001 B conf
On Star Coloring of Graphs.
WG
Guillaume Fertin, André Raspaud, Bruce A. Reed
2001 J jnl
On nice graphs.
Discret. Math.
Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001 B conf
Small k-Dominating Sets in Planar Graphs with Applications.
WG
Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena
2001 B conf
k-Neighborhood Broadcasting.
SIROCCO
Guillaume Fertin, André Raspaud
2000 J jnl
Colored Homomorphisms of Colored Mixed Graphs.
J. Comb. Theory B
Jaroslav Nesetril, André Raspaud
2000 B conf
Congestion and dilation, similarities and differences: A survey.
SIROCCO
André Raspaud, Ondrej Sýkora, Imrich Vrto
2000 B conf
Diameter of the Knödel Graph.
WG
Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
2000 J jnl
Recognizing Recursive Circulant Graphs (Extended Abstract).
Electron. Notes Discret. Math.
Guillaume Fertin, André Raspaud
1999 J jnl
On the maximum average degree and the oriented chromatic number of a graph.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
1999 B ed.
SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999
SIROCCO
Cyril Gavoille, Jean-Claude Bermond, André Raspaud
1998 B conf
Families of Graphs Having Broadcasting and Gossiping Properties.
WG
Guillaume Fertin, André Raspaud
1998 J jnl
On universal graphs for planar oriented graphs of a given girth.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
1998 J jnl
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.
IEEE Trans. Parallel Distributed Syst.
Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
1998 B conf
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition.
WG
Ginette Gauyacq, C. Micheneau, André Raspaud
1997 — conf
Broadcasting and Multicasting in Cut-through Routed Networks.
IPPS
Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
1997 J jnl
Colorings and girth of oriented planar graphs.
Discret. Math.
Jarik Nesetril, André Raspaud, Éric Sopena
1997 J jnl
Periodic Gossiping in Back-to-back Trees.
Discret. Appl. Math.
Roger Labahn, André Raspaud
1996 J jnl
Hamiltonian properties and the bipartite independence number.
Discret. Math.
Oscar Ordaz, Denise Amar, André Raspaud
1995 J jnl
Compatible Eulerian Circuits in K
Discret. Appl. Math.
Dominique Barth, Johny Bond, André Raspaud
1995 J jnl
Cutwidth of the Bruijn Graph.
RAIRO Theor. Informatics Appl.
André Raspaud, Ondrej Sýkora, Imrich Vrto
1995 J jnl
On Bandwidth, Cutwidth, and Quotient Graphs.
RAIRO Theor. Informatics Appl.
Dominique Barth, François Pellegrini, André Raspaud, Jean Roman
1994 J jnl
Fulkerson's Conjecture and Circuit Covers.
J. Comb. Theory B
Genghua Fan, André Raspaud
1994 J jnl
Good and Semi-Strong Colorings of Oriented Planar Graphs.
Inf. Process. Lett.
André Raspaud, Éric Sopena
1994 J jnl
Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph.
Inf. Process. Lett.
Dominique Barth, André Raspaud
1993 J jnl
Postman tours and cycle covers.
Discret. Math.
André Raspaud
1991 J jnl
Covering the vertices of a digraph by cycles of prescribed length.
Discret. Math.
Denise Amar, André Raspaud
1991 J jnl
Cycle covers of graphs with a nowhere-zero 4-flow.
J. Graph Theory
André Raspaud
1987 J jnl
Short circuit covers for regular matroids with a nowhere zero 5-flow.
J. Comb. Theory B
Ury Jamshy, André Raspaud, Michael Tarsi
1985 — —
Flots et couvertures par des cycles dans les graphes et les matroïdes. (Flows and coverings by cycles in graphs and matroids).
André Raspaud