André Raspaud

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 19

Top Venues

Discret. Appl. Math.

J. Graph Theory

Eur. J. Comb.

J. Comb. Optim.

Joseph Fourier University, Grenoble, France (PHD)

Education History

Joseph Fourier University, Grenoble, France

PHD

Publications

Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu
)-partition of planar graphs with girth at least 5. Discret. Math. 346 (2) (2023)
Min Chen, André Raspaud, Weiqiang Yu
An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6. J. Graph Theory 99 (2) (2022)
Baya Ferdjallah, Samia Kerdjoudj, André Raspaud
Injective edge-coloring of subcubic graphs. Discret. Math. Algorithms Appl. 14 (8) (2022)
Alexandr V. Kostochka, André Raspaud, Jingwei Xu
Injective edge-coloring of graphs with given maximum degree. Eur. J. Comb. 96 (2021)
Alexandr V. Kostochka, André Raspaud, Bjarne Toft, Douglas B. West, Dara Zirlin
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree. Graphs Comb. 37 (1) (2021)
Carl Johan Casselgren, Jonas B. Granholm, André Raspaud
On star edge colorings of bipartite and subcubic graphs. Discret. Appl. Math. 298 (2021)
Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang
Choosability with separation of planar graphs without prescribed cycles. Appl. Math. Comput. 367 (2020)
Samia Kerdjoudj, André Raspaud
List star edge-coloring of k-degenerate graphs and K4-minor free graphs. Discret. Appl. Math. 261 (2019)
Min Chen, André Raspaud
Acyclic improper choosability of subcubic graphs. Appl. Math. Comput. 356 (2019)
Christopher Duffy, Gary MacGillivray, Pascal Ochem, André Raspaud
Oriented incidence colourings of digraphs. Discuss. Math. Graph Theory 39 (1) (2019)
Samia Kerdjoudj, André Raspaud
List star edge coloring of sparse graphs. Discret. Appl. Math. 238 (2018)
Samia Kerdjoudj, Kavita Pradeep, André Raspaud
List star chromatic index of sparse graphs. Discret. Math. 341 (7) (2018)
Samia Kerdjoudj, Alexandr V. Kostochka, André Raspaud
List star edge-coloring of subcubic graphs. Discuss. Math. Graph Theory 38 (4) (2018)
Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud
Strong edge-colorings of sparse graphs with large maximum degree. Eur. J. Comb. 67 (2018)
Jakub Przybylo, André Raspaud, Mariusz Wozniak
On weight choosabilities of graphs with bounded maximum average degree. Discret. Appl. Math. 217 (2017)
Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
Incidence coloring of graphs with high maximum average degree. Discret. Appl. Math. 227 (2017)
Edita Mácajová, André Raspaud, Martin Skoviera
The Chromatic Number of a Signed Graph. Electron. J. Comb. 23 (1) (2016)
Min Chen, André Raspaud, Weifan Wang
A (3, 1) ∗-choosable theorem on planar graphs. J. Comb. Optim. 32 (3) (2016)
Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera
Circuit Covers of Signed Graphs. J. Graph Theory 81 (2) (2016)
Ilkyoo Choi, André Raspaud
Planar graphs with girth at least 5 are (3, 5)-colorable. Discret. Math. 338 (4) (2015)
Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud
Strong chromatic index of planar graphs with large girth. Discuss. Math. Graph Theory 34 (4) (2014)
Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
Incidence coloring of graphs with high maximum average degree. CoRR (2014)
Gary MacGillivray, André Raspaud, Jacobus Swarts
Obstructions to locally injective oriented improper colourings. Eur. J. Comb. 35 (2014)
Min Chen, André Raspaud
On (3, 2)*-choosability of planar graphs without adjacent short cycles. Discret. Appl. Math. 162 (2014)
Min Chen, André Raspaud, Weifan Wang
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. Graphs Comb. 30 (4) (2014)
Min Chen, André Raspaud, Weifan Wang
Star list chromatic number of planar subcubic graphs. J. Comb. Optim. 27 (3) (2014)
Paul Dorbec, Tomás Kaiser, Mickaël Montassier, André Raspaud
Limits of Near-Coloring of Sparse Graphs. J. Graph Theory 75 (2) (2014)
Min Chen, André Raspaud
(3, 1)*-choosability of planar graphs without adjacent short cycles. Electron. Notes Discret. Math. 43 (2013)
Jaroslav Nesetril, André Raspaud
Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 (2012) 685-687]. Eur. J. Comb. 34 (7) (2013)
Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov
On strong edge-colouring of subcubic graphs. Discret. Appl. Math. 161 (16-17) (2013)
Paul Dorbec, Michael A. Henning, Christian Löwenstein, Mickaël Montassier, André Raspaud
Generalized Power Domination in Regular Graphs. SIAM J. Discret. Math. 27 (3) (2013)
Clément Charpentier, Mickaël Montassier, André Raspaud
L(p, q)-labeling of sparse graphs. J. Comb. Optim. 25 (4) (2013)
Min Chen, André Raspaud
Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Discret. Appl. Math. 161 (7-8) (2013)
Min Chen, André Raspaud, Weifan Wang
6-Star-Coloring of Subcubic Graphs. J. Graph Theory 72 (2) (2013)
Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud
Generalized power domination of graphs. Discret. Appl. Math. 160 (12) (2012)
Jaroslav Nesetril, André Raspaud
Preface. Eur. J. Comb. 33 (5) (2012)
André Raspaud, Li-Da Tong
The minimum identifying code graphs. Discret. Appl. Math. 160 (9) (2012)
Min Chen, André Raspaud
A sufficient condition for planar graphs to be acyclically 5-choosable. J. Graph Theory 70 (2) (2012)
Gerard Jennhwa Chang, Paul Dorbec, Hye Kyung Kim, André Raspaud, Haichao Wang, Weiliang Zhao
Upper k-tuple domination in graphs. Discret. Math. Theor. Comput. Sci. 14 (2) (2012)
Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
On backbone coloring of graphs. J. Comb. Optim. 23 (1) (2012)
Min Chen, André Raspaud, Weifan Wang
Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33 (5) (2012)
Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu
Decomposing a graph into forests. J. Comb. Theory, Ser. B 102 (1) (2012)
Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
On the size of identifying codes in triangle-free graphs. Discret. Appl. Math. 160 (10-11) (2012)
Min Chen, Mickaël Montassier, André Raspaud
Some structural properties of planar graphs and their applications to 3-choosability. Discret. Math. 312 (2) (2012)
Min Chen, Gena Hahn, André Raspaud, Weifan Wang
Some results on the injective chromatic number of graphs. J. Comb. Optim. 24 (3) (2012)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
(k, 1)-coloring of sparse graphs. Discret. Math. 312 (6) (2012)
Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu
Acyclic 4-choosability of planar graphs. Discret. Math. 311 (1) (2011)
Clément Charpentier, Mickaël Montassier, André Raspaud
Minmax degree of graphs (Extended abstract). Electron. Notes Discret. Math. 38 (2011)
Chao Li, Weifan Wang, André Raspaud
Upper bounds on the linear chromatic number of a graph. Discret. Math. 311 (4) (2011)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
(k, j)-coloring of sparse graphs. Discret. Appl. Math. 159 (17) (2011)
Min Chen, André Raspaud, Weifan Wang
8-star-choosability of a graph with maximum average degree less than 3. Discret. Math. Theor. Comput. Sci. 13 (3) (2011)
Tomás Kaiser, Mickaël Montassier, André Raspaud
Covering a Graph by Forests and a Matching. SIAM J. Discret. Math. 25 (4) (2011)
Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu
Short cycle covers of graphs and nowhere-zero flows. J. Graph Theory 68 (4) (2011)
Gary MacGillivray, André Raspaud, Jacobus Swarts
Obstructions to Injective Oriented Colourings. Electron. Notes Discret. Math. 38 (2011)
André Raspaud, Xuding Zhu
Circular flow on signed graphs. J. Comb. Theory, Ser. B 101 (6) (2011)
Min Chen, André Raspaud
On acyclic 4-choosability of planar graphs without short cycles. Discret. Math. 310 (15-16) (2010)
Oleg V. Borodin, Anna O. Ivanova, André Raspaud
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Discret. Math. 310 (21) (2010)
Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud
Acyclic 3-choosability of sparse graphs with girth at least 7. Discret. Math. 310 (17-18) (2010)
Oleg V. Borodin, Alexei N. Glebov, André Raspaud
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Discret. Math. 310 (20) (2010)
Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu
Decomposition of sparse graphs, with application to game coloring number. Discret. Math. 310 (10-11) (2010)
Mickaël Montassier, André Raspaud, Xuding Zhu
Decomposition of sparse graphs into two forests, one having bounded maximum degree. Inf. Process. Lett. 110 (20) (2010)
Hervé Hocquard, Mickaël Montassier, André Raspaud
A note on the acyclic 3-choosability of some planar graphs. Discret. Appl. Math. 158 (10) (2010)
Min Chen, André Raspaud
Homomorphisms from sparse graphs to the Petersen graph. Discret. Math. 310 (20) (2010)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud
. J. Graph Theory 65 (2) (2010)
Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
On the size of identifying codes in triangle-free graphs CoRR (2010)
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. 158 (12) (2010)
Oleg V. Borodin, Mickaël Montassier, André Raspaud
Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discret. Math. 310 (1) (2010)
Tomás Kaiser, André Raspaud
Perfect matchings with restricted intersection in cubic graphs. Eur. J. Comb. 31 (5) (2010)
Alain Doyon, Gena Hahn, André Raspaud
Some bounds on the injective chromatic number of graphs. Discret. Math. 310 (3) (2010)
Gary MacGillivray, André Raspaud, Jacobus Swarts
Injective Oriented Colourings. WG (2009)
Min Chen, André Raspaud
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Electron. Notes Discret. Math. 34 (2009)
Jaroslav Nesetril, André Raspaud
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). Electron. Notes Discret. Math. 34 (2009)
André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discret. Math. 309 (11) (2009)
Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena
Chromatic number of sparse colored mixed planar graphs. Electron. Notes Discret. Math. 34 (2009)
Jiaojiao Wu, André Raspaud
Game chromatic number of toroidal grids. Electron. Notes Discret. Math. 34 (2009)
André Raspaud, Jiaojiao Wu
Game chromatic number of toroidal grids. Inf. Process. Lett. 109 (21-22) (2009)
Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang
Star coloring of sparse graphs. J. Graph Theory 62 (3) (2009)
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 99 (4) (2009)
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. 30 (1) (2009)
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. Discret. Math. 309 (13) (2009)
Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang
Injective coloring of planar graphs. Discret. Appl. Math. 157 (4) (2009)
Olivier Delmas, André Raspaud
Preface. Discret. Math. 309 (11) (2009)
André Raspaud, Weifan Wang
Linear coloring of planar graphs with large girth. Discret. Math. 309 (18) (2009)
Mickaël Montassier, André Raspaud, Xuding Zhu
An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30 (2) (2009)
Louis Esperet, Mickaël Montassier, André Raspaud
Linear choosability of graphs. Discret. Math. 308 (17) (2008)
Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang
A relaxation of Havel's 3-color problem. Inf. Process. Lett. 107 (3-4) (2008)
André Raspaud, Weifan Wang
On the vertex-arboricity of planar graphs. Eur. J. Comb. 29 (4) (2008)
Pavol Hell, André Raspaud, Juraj Stacho
On Injective Colourings of Chordal Graphs. LATIN (2008)
Guillaume Fertin, André Raspaud
Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Inf. Process. Lett. 105 (2) (2008)
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. 30 (2008)
Min Chen, André Raspaud, Weifan Wang
Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101 (3) (2007)
Tomás Kaiser, André Raspaud
Non-intersecting perfect matchings in cubic graphs (Extended abstract). Electron. Notes Discret. Math. 28 (2007)
André Raspaud, Nicolas Roussel
Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract. Electron. Notes Discret. Math. 28 (2007)
Mickaël Montassier, André Raspaud, Weifan Wang
Acyclic 5-choosability of planar graphs without small cycles. J. Graph Theory 54 (3) (2007)
André Raspaud, Xuding Zhu
List circular coloring of trees and cycles. J. Graph Theory 55 (3) (2007)
Daniel Gonçalves, André Raspaud, M. A. Shalu
On Oriented Labelling Parameters. Formal Models, Languages and Applications (2007)
Guillaume Fertin, André Raspaud
L(p, q) labeling of d-dimensional grids. Discret. Math. 307 (16) (2007)
Fabrice Bazzaro, Mickaël Montassier, André Raspaud
(d, 1)-total labelling of planar graphs with large girth and high maximum degree. Discret. Math. 307 (16) (2007)
Mickaël Montassier, André Raspaud
, 1)-total labeling of graphs with a given maximum average degree. J. Graph Theory 51 (2) (2006)
Mickaël Montassier, André Raspaud, Weifan Wang
Bordeaux 3-color conjecture and 3-choosability. Discret. Math. 306 (6) (2006)

André Raspaud.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

André Raspaud