André Raspaud

Generating author description...

All published works

Action	Title	Year	Authors
+	An (F3,F5)-partition of planar graphs with girth at least 5	2022	Min Chen André Raspaud Weifan Wang Weiqiang Yu
+	An (F1,F4)‐partition of graphs with low genus and girth at least 6	2021	Min Chen André Raspaud Weiqiang Yu
+ PDF Chat	Injective edge-coloring of graphs with given maximum degree	2021	Alexandr Kostochka André Raspaud Jingwei Xu
+	On star edge colorings of bipartite and subcubic graphs	2021	Carl Johan Casselgren Jonas B. Granholm André Raspaud
+	Star coloring of sparse graphs	2021	Yuehua Bu Daniel W. Cranston Mickaël Montassier André Raspaud Weifan Wang
+	A note on adaptable choosability and choosability with separation of planar graphs	2020	Carl Johan Casselgren Jonas B. Granholm André Raspaud
+ PDF Chat	Cut-Edges and Regular Factors in Regular Graphs of Odd Degree	2020	Alexandr Kostochka André Raspaud Bjarne Toft Douglas B. West Dara Zirlin
+	Injective edge-coloring of graphs with given maximum degree	2020	Alexandr Kostochka André Raspaud Jingwei Xu
+	A note on adaptable choosability and choosability with separation of planar graphs	2020	Carl Johan Casselgren Jonas B. Granholm André Raspaud
+	Induced star arboricity and injective edge-coloring of graphs	2019	Baya Ferdjallah Samia Kerdjoudj André Raspaud
+ PDF Chat	List star edge-coloring of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e36" altimg="si21.gif"><mml:mi>k</mml:mi></mml:math>-degenerate graphs and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e41" altimg="si22.gif"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-minor free graphs	2019	Samia Kerdjoudj André Raspaud
+	Injective edge-coloring of sparse graphs	2019	Baya Ferdjallah Samia Kerdjoudj André Raspaud
+	Cut-edges and regular factors in regular graphs of odd degree	2018	Alexander V. Kostochka André Raspaud Bjarne Toft Douglas B. West Dara Zirlin
+	List star chromatic index of sparse graphs	2018	Samia Kerdjoudj Kavita Pradeep André Raspaud
+	List star edge coloring of sparse graphs	2018	Samia Kerdjoudj André Raspaud
+	List star edge-coloring of subcubic graphs	2018	Samia Kerdjoudj Alexander V. Kostochka André Raspaud
+	Cut-edges and regular factors in regular graphs of odd degree	2018	Alexander V. Kostochka André Raspaud Sune Toft Douglas B. West Dara Zirlin
+ PDF Chat	Strong edge-colorings of sparse graphs with large maximum degree	2017	Ilkyoo Choi Jaehoon Kim Alexandr Kostochka André Raspaud
+	Incidence coloring of graphs with high maximum average degree	2017	Marthe Bonamy Hervé Hocquard Samia Kerdjoudj André Raspaud
+ PDF Chat	The Chromatic Number of a Signed Graph	2016	Edita Máčajová André Raspaud Martin Škoviera
+ PDF Chat	Planar graphs with girth at least <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si14.gif" display="inline" overflow="scroll"><mml:mn>5</mml:mn></mml:math> are <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si15.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-colorable	2015	Ilkyoo Choi André Raspaud
+	Incidence coloring of graphs with high maximum average degree	2014	Marthe Bonamy Hervé Hocquard Samia Kerdjoudj André Raspaud
+	The chromatic number of a signed graph	2014	Edita Máčajová André Raspaud Martin Škoviera
+	The chromatic number of a signed graph	2014	Edita Máčajová André Raspaud Martin Škoviera
+	Incidence coloring of graphs with high maximum average degree	2014	Marthe Bonamy Hervé Hocquard Samia Kerdjoudj André Raspaud
+ PDF Chat	(3, 1)*-choosability of planar graphs without adjacent short cycles	2013	Min Chen André Raspaud
+ PDF Chat	Limits of Near‐Coloring of Sparse Graphs	2013	Paul Dorbec Tomáš Kaiser Mickaël Montassier André Raspaud
+	Strong chromatic index of planar graphs with large girth	2013	Mickaël Montassier Arnaud Pêcher André Raspaud
+	$(3,1)^*$-choosability of planar graphs without adjacent short cycles	2013	Min Chen André Raspaud
+	Star list chromatic number of planar subcubic graphs	2012	Min Chen André Raspaud Weifan Wang
+	6‐Star‐Coloring of Subcubic Graphs	2012	Min Chen André Raspaud Weifan Wang
+	On the size of identifying codes in triangle-free graphs	2012	Florent Foucaud Ralf Klasing Adrian Kosowski André Raspaud
+	Vertex-arboricity of planar graphs without intersecting triangles	2011	Min Chen André Raspaud Weifan Wang
+	Steinberg's Conjecture and near-colorings	2011	Gerard J. Chang Frédéric Havet Mickaël Montassier André Raspaud
+	Circular flow on signed graphs	2011	André Raspaud Xuding Zhu
+	Short cycle covers of graphs and nowhere-zero flows	2011	Edita Máčajová André Raspaud Michael Tarsi Xuding Zhu
+	Some results on the injective chromatic number of graphs	2011	Min Chen Geňa Hahn André Raspaud Weifan Wang
+ PDF Chat	Covering a Graph by Forests and a Matching	2011	Tomáš Kaiser Mickaël Montassier André Raspaud
+	None	2010	O. V. Borodin A. O. Ivanova Mickaël Montassier Pascal Ochem André Raspaud
+	On backbone coloring of graphs	2010	Weifan Wang Yuehua Bu Mickaël Montassier André Raspaud
+	Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles	2010	O. V. Borodin A. O. Ivanova André Raspaud
+	Decomposition of sparse graphs into two forests, one having bounded maximum degree	2010	Mickaël Montassier André Raspaud Xuding Zhu
+	Covering a graph by forests and a matching	2010	Tomáš Kaiser Mickaël Montassier André Raspaud
+	Decomposition of sparse graphs, with application to game coloring number	2010	Mickaël Montassier Arnaud Pêcher André Raspaud Douglas B. West Xuding Zhu
+	Covering a graph by forests and a matching	2010	Tomáš Kaiser Mickaël Montassier André Raspaud
+	Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most <i>k</i>	2009	O. V. Borodin A. O. Ivanova Mickaël Montassier Pascal Ochem André Raspaud
+	Injective Oriented Colourings	2009	Gary MacGillivray André Raspaud Jacobus Swarts
+	Perfect matchings with restricted intersection in cubic graphs	2009	Tomáš Kaiser André Raspaud
+	Homomorphisms of 2-edge-colored graphs	2009	Amanda Montejano Pascal Ochem Alexandre Pinlou André Raspaud Éric Sopena
+	Star coloring of sparse graphs.	2009	Yuehua Bu Daniel W. Cranston Mickaël Montassier André Raspaud Weifan Wang
+	Game chromatic number of toroidal grids	2009	André Raspaud Jiaojiao Wu
+ PDF Chat	Chromatic number of sparse colored mixed planar graphs	2009	Amanda Montejano Alexandre Pinlou André Raspaud Éric Sopena
+	Game chromatic number of toroidal grids	2009	Jiaojiao Wu André Raspaud
+	Some bounds on the injective chromatic number of graphs	2009	Alain Doyon Geňa Hahn André Raspaud
+ PDF Chat	Star coloring of sparse graphs	2009	Yuehua Bu Daniel W. Cranston Mickaël Montassier André Raspaud Weifan Wang
+ PDF Chat	Edge-partitions of sparse graphs and their applications to game coloring	2009	Mickaël Montassier Arnaud Pêcher André Raspaud Xuding Zhu
+	Injective coloring of planar graphs	2008	Yuehua Bu Dong Chen André Raspaud Weifan Wang
+	An upper bound on adaptable choosability of graphs	2008	Mickaël Montassier André Raspaud Xuding Zhu
+	Linear coloring of planar graphs with large girth	2008	André Raspaud Weifan Wang
+	On Injective Colourings of Chordal Graphs	2008	Pavol Hell André Raspaud Juraj Stacho
+	Homomorphisms of 2-edge-colored graphs	2008	Amanda Montejano Pascal Ochem Alexandre Pinlou André Raspaud Éric Sopena
+ PDF Chat	Vertex labeling and routing in expanded Apollonian networks	2008	Zhongzhi Zhang Francesc Comellas Guillaume Fertin André Raspaud Lili Rong Shuigeng Zhou
+ PDF Chat	Acyclic coloring of graphs of maximum degree five: Nine colors are enough	2007	Guillaume Fertin André Raspaud
+	Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract	2007	André Raspaud Nicolas Roussel
+ PDF Chat	List circular coloring of trees and cycles	2007	André Raspaud Xuding Zhu
+	On Edge-maps whose Inverse Preserves Flows or Tensions	2006	Matt DeVos Jaroslav Nešetřil André Raspaud
+	On the strong circular 5‐flow conjecture	2006	Edita Máčajová André Raspaud
+	On the acyclic choosability of graphs	2006	Mickaël Montassier Pascal Ochem André Raspaud
+	A note on 2-facial coloring of plane graphs	2006	Mickaël Montassier André Raspaud
+ PDF Chat	(<i>d</i>,1)‐total labeling of graphs with a given maximum average degree	2005	Mickaël Montassier André Raspaud
+	Star coloring of graphs	2004	Guillaume Fertin André Raspaud Bruce Reed
+	Star coloring of graphs	2004	Guillaume Fertin André Raspaud Bruce Reed
+ PDF Chat	Recursive graphs with small-world scale-free properties	2004	Francesc Comellas Guillaume Fertin André Raspaud
+	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+ PDF Chat	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+ PDF Chat	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+ PDF Chat	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+ PDF Chat	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+ PDF Chat	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+ PDF Chat	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+ PDF Chat	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+	A Survey of Knödel Graphs	2004	Guillaume Fertin André Raspaud
+	Antisymmetric flows and edge-connectivity	2003	Matt DeVos Jaroslav Nešetřil André Raspaud
+ PDF Chat	Acyclic and k-distance coloring of the grid	2003	Guillaume Fertin Emmanuel Godard André Raspaud
+ PDF Chat	On the oriented chromatic number of grids	2003	Guillaume Fertin André Raspaud Arup Roychowdhury
+	A Survey on Knödel Graphs	2003	Guillaume Fertin André Raspaud
+	A Survey on Knödel Graphs	2003	Guillaume Fertin André Raspaud
+	A Survey on Knödel Graphs	2003	Guillaume Fertin André Raspaud
+	A Survey on Knödel Graphs	2003	Guillaume Fertin André Raspaud
+	A Survey on Knödel Graphs	2003	Guillaume Fertin André Raspaud
+	A Survey on Knödel Graphs	2003	Guillaume Fertin André Raspaud
+	A Survey on Knödel Graphs	2003	Guillaume Fertin André Raspaud
+	A Survey on Knödel Graphs	2003	Guillaume Fertin André Raspaud
+ PDF Chat	Minimum feedback vertex set and acyclic coloring	2002	Guillaume Fertin Emmanuel Godard André Raspaud
+	None	2002	O. V. Borodin Alexandr Kostochka André Raspaud Éric Sopena
+	Nilpotent families of endomorphisms of $(P(V)^+,cup)$	2002	D. Fon-Der-Flaass A.V. Kostochka André Raspaud Éric Sopena
+	On Star Coloring of Graphs	2001	Guillaume Fertin André Raspaud Bruce Reed
+	On Deeply Critical Oriented Graphs	2001	O. V. Borodin D. Fon-Der-Flaass Alexandr Kostochka André Raspaud Éric Sopena
+	Colored Homomorphisms of Colored Mixed Graphs	2000	Jaroslav Nešetřil André Raspaud
+	Recognizing Recursive Circulant Graphs (Extended Abstract)	2000	Guillaume Fertin André Raspaud
+	Diameter of the Knödel Graph	2000	Guillaume Fertin André Raspaud Heiko Schröder Ondřej Sýkora Imrich Vrt’o
+	Three-and-more set theorems	2000	Pavol Hell J. Neÿsetÿ André Raspaud Éric Sopena
+ PDF Chat	Antisymmetric flows and strong colourings of oriented graphs	1999	J. Nešetřill André Raspaud
+	On universal graphs for planar oriented graphs of a given girth	1998	O.V. Borodin A.V. Kostochka Jaroslav Nešetřil André Raspaud Éric Sopena
+	Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition	1998	Ginette Gauyacq C. Micheneau André Raspaud
+	Colorings and girth of oriented planar graphs	1997	Jaroslav Nešetřil André Raspaud Éric Sopena
+	Hamiltonian properties and the bipartite independence number	1996	Óscar Ordaz Denise Amar André Raspaud
+	Compatible eulerian circuits in Kn∗∗	1995	Dominique Barth J.W. Bond André Raspaud
+	Postman tours and cycle covers	1993	André Raspaud
+	Cycle covers of graphs with a nowhere‐zero 4‐flow	1991	André Raspaud
+	Covering the vertices of a digraph by cycles of prescribed length	1991	Denise Amar André Raspaud
+	Short circuit covers for regular matroids with a nowhere zero 5-flow	1987	Ury Jamshy André Raspaud Michael Tarsi

Common Coauthors

Coauthor	Papers Together
Guillaume Fertin	30
Mickaël Montassier	19
Weifan Wang	10
Samia Kerdjoudj	9
Éric Sopena	9
Min Chen	8
Xuding Zhu	7
Alexandr Kostochka	6
Tomáš Kaiser	5
Pascal Ochem	5
Yuehua Bu	5
O. V. Borodin	5
Edita Máčajová	5
Jaroslav Nešetřil	5
Douglas B. West	4
Amanda Montejano	3
Marthe Bonamy	3
Carl Johan Casselgren	3
Arnaud Pêcher	3
Jonas B. Granholm	3
Alexandre Pinlou	3
Martin Škoviera	3
Hervé Hocquard	3
Daniel W. Cranston	3
Dara Zirlin	3
Bruce Reed	3
A. O. Ivanova	3
Alexander V. Kostochka	3
Weiqiang Yu	2
Denise Amar	2
Baya Ferdjallah	2
Matt DeVos	2
Bjarne Toft	2
Jingwei Xu	2
Ilkyoo Choi	2
Emmanuel Godard	2
Jiaojiao Wu	2
Francesc Comellas	2
Michael Tarsi	2
A.V. Kostochka	2
Pavol Hell	2
Kavita Pradeep	1
O.V. Borodin	1
Ury Jamshy	1
J. Nešetřill	1
Shuigeng Zhou	1
D. Fon-Der-Flaass	1
Gen̆a Hahn	1
Jacobus Swarts	1
Heiko Schröder	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	On acyclic colorings of planar graphs	1979	O. V. Borodin	14
+	On acyclic colorings of planar graphs	2006	O. V. Borodin	13
+	The chromatic number of oriented graphs	1997	Éric Sopena	12
+	The chromatic number of oriented graphs	1997	Éric Sopena	11
+	Colorings and girth of oriented planar graphs	1997	Jaroslav Nešetřil André Raspaud Éric Sopena	7
+	On Star Coloring of Graphs	2001	Guillaume Fertin André Raspaud Bruce Reed	7
+ PDF Chat	None	1998	Noga Alon T. H. Marshall	6
+ PDF Chat	Coloring with no $2$-Colored $P_4$'s	2004	Michael O. Albertson Glenn G. Chappell H. A. Kierstead André Kündgen Radhika Ramamurthi	6
+	Edge-partitions of planar graphs and their game coloring numbers	2002	Wenjie He Xiaoling Hou Ko‐Wei Lih Jiating Shao Weifan Wang Xuding Zhu	6
+	Coloring the square of a K4-minor free graph	2003	Ko‐Wei Lih Weifan Wang Xuding Zhu	6
+	Minimum partition of a matroid into independent subsets	1965	Jack Edmonds	6
+	The Game Coloring Number of Planar Graphs	1999	Xuding Zhu	5
+	Strong chromatic index of graphs	2015	Michaĺ Deͅbski	5
+ PDF Chat	A Contribution to the Theory of Chromatic Polynomials	1954	W. T. Tutte	5
+	Incidence and strong edge colorings of graphs	1993	Richard A. Brualdi Jennifer J. Q. Massey	5
+	Acyclic and oriented chromatic numbers of graphs	1997	Alexandr Kostochka Éric Sopena Xuding Zhu	5
+	Flows and generalized coloring theorems in graphs	1979	F. M. Jaeger	5
+	Colored Homomorphisms of Colored Mixed Graphs	2000	Jaroslav Nešetřil André Raspaud	5
+ PDF Chat	Star Edge Coloring of Some Classes of Graphs	2015	L’udmila Bezegová Borut Lužar Martina Mockovčiaková Roman Soták Riste Škrekovski	5
+	Acyclic and oriented chromatic numbers of graphs	1997	Alexandr Kostochka Éric Sopena Xuding Zhu	5
+	Improper choosability of graphs and maximum average degree	2006	Frédéric Havet Jean‐Sébastien Sereni	5
+	Star Chromatic Index	2012	Zdeněk Dvořák Bojan Mohar Robert Šámal	5
+	List star edge-coloring of subcubic graphs	2018	Samia Kerdjoudj Alexander V. Kostochka André Raspaud	4
+ PDF Chat	Edge‐partitions of planar graphs and their game coloring numbers	2002	Wenjie He Xiaoling Hou Ko‐Wei Lih Jiating Shao Weifan Wang Xuding Zhu	4
+	Covering planar graphs with forests, one having bounded maximum degree	2008	Daniel Gonçalves	4
+	Acyclic coloring of graphs	1991	Noga Alon Colin McDiarmid Bruce Reed	4
+	Colorings and Homomorphisms of Minor Closed Classes	2003	Jaroslav Nešetřil Patrice Ossona de Mendez	4
+	Nowhere-zero 6-flows	1981	Paul Seymour	4
+	Every Planar Graph Is 5-Choosable	1994	Carsten Thomassen	4
+	Refined activation strategy for the marking game	2007	Xuding Zhu	4
+	The Point-Arboricity of Planar Graphs	1969	Gary Chartrand Hudson V. Kronk	4
+	Star coloring of sparse graphs.	2009	Yuehua Bu Daniel W. Cranston Mickaël Montassier André Raspaud Weifan Wang	4
+	On (k,d)-colorings and fractional nowhere-zero flows	1998	Luis Goddyn Michael Tarsi Cun‐Quan Zhang	4
+	Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most <i>k</i>	2009	O. V. Borodin A. O. Ivanova Mickaël Montassier Pascal Ochem André Raspaud	4
+	Injective edge coloring of sparse graphs	2018	Yuehua Bu Chentao Qi	3
+	Induced and weak induced arboricities	2018	Maria Axenovich Philip Dörr Jonathan Rollin Torsten Ueckerdt	3
+	Homomorphisms from sparse graphs with large girth	2003	O. V. Borodin S.-J. Kim Alexandr Kostochka Douglas B. West	3
+ PDF Chat	A Class Of Abelian Groups	1956	W. T. Tutte	3
+	Shortest coverings of graphs with cycles	1983	Jean Claude Bermond Bill Jackson François Jaeger	3
+	The State of the Three Color Problem	1993	Richard Steinberg	3
+	None	2010	O. V. Borodin A. O. Ivanova Mickaël Montassier Pascal Ochem André Raspaud	3
+	None	2010	Wensong Lin Daphne Der-Fen Liu Xuding Zhu	3
+	Star chromatic number	1988	Andrew Vince	3
+	On (k, d)-colorings and fractional nowhere-zero flows	1998	Luis Goddyn Michael Tarsi Cun‐Quan Zhang	3
+	List Edge and List Total Colourings of Multigraphs	1997	O. V. Borodin Alexandr Kostochka Douglas R. Woodall	3
+	Note to the paper of Grünbaum on acyclic colorings	1976	Alexandr Kostochka Leonid S. Mel’nikov	3
+	None	2009	Pierre Hansen Alain Hertz Rim Kilani Odile Marcotte David Schindl	3
+	The incidence coloring conjecture for graphs of maximum degree 3	2005	Maksim Maydanskiy	3
+ PDF Chat	Acyclic and k-distance coloring of the grid	2003	Guillaume Fertin Emmanuel Godard André Raspaud	3
+	Recent Developments in Circular Colouring of Graphs	2007	Xuding Zhu	3