Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Raspaud, Andr{\'e}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Plane graphs with maximum degree 6 are edge-face 8-colorable
Min Chen
,
André Raspaud
,
Weifan Wang
Graphs and Combinatorics
30
(4), 2014, pp. 861-874
Limits of near-coloring of sparse graphs
Paul Dorbec
,
Tomás̑ Kaiser
,
Mickael Montassier
,
André Raspaud
Journal of Graph Theory
75
(2), 2014, pp. 191-202
6-star-coloring of subcubic graphs
Min Chen
,
André Raspaud
,
Weifan Wang
Journal of Graph Theory
72
(2), 2013, pp. 128-145
Generalized power domination in regular graphs
Paul Dorbec
,
Michael A. Henning
,
Christian Löwenstein
,
Mickael Montassier
,
André Raspaud
SIAM Journal on Discrete Mathematics
27
(3), 2013, pp. 1559-1574
A sufficient condition for planar graphs to be acyclically 5-choosable
Min Chen
,
André Raspaud
Journal of Graph Theory
70
(2), 2012, pp. 135-151
Decomposing a graph into forests
Mickael Montassier
,
Patrice Ossona de Mendez
,
André Raspaud
,
Xuding Zhu
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 38-52
Covering a graph by forests and a matching
Tomás̑ Kaiser
,
Michaël Montassier
,
André Raspaud
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1804-1811
Short cycle covers of graphs and nowhere-zero flows
Edita Mác̑ajová
,
André Raspaud
,
Michael Tarsi
,
Xuding Zhu
Journal of Graph Theory
68
(4), 2011, pp. 340-348
Injective oriented colourings
Gary MacGillivray
,
André Raspaud
,
Jacobus Swarts
Lecture Notes in Computer Science
5911
, 2010, pp. 262-272
Decomposition of sparse graphs into two forests, one having bounded maximum degree
Mickael Montassier
,
André Raspaud
,
Xuding Zhu
Information Processing Letters
110
(20), 2010, pp. 913-916
A relaxation of Havel's 3-color problem
Mickaël Montassier
,
André Raspaud
,
Weifan Wang
,
Yingqian Wang
Information Processing Letters
107
(3-4), 2008, pp. 107-109
Three-coloring planar graphs without short cycles
Min Chen
,
André Raspaud
,
Weifan Wang
Information Processing Letters
101
(3), 2007, pp. 134-138
Acyclic coloring of graphs of maximum degree five: Nine colors are enough
Guillaume Fertin
,
André Raspaud
Information Processing Letters
105
(2), 2007, pp. 65-72
Acyclic 5-choosability of planar graphs without small cycles
Mickaël Montassier
,
André Raspaud
,
Weifan Wang
Journal of Graph Theory
54
(3), 2007, pp. 245-260
List circular coloring of trees and cycles
André Raspaud
,
Xuding Zhu
Journal of Graph Theory
55
(3), 2007, pp. 249-265
On the strong circular 5-flow conjecture
Edita Mác̑ajová
,
André Raspaud
Journal of Graph Theory
52
(4), 2006, pp. 307-316
On the acyclic choosability of graphs
Mickaël Montassier
,
Pascal Ochem
,
André Raspaud
Journal of Graph Theory
51
(4), 2006, pp. 281-300
A note on 2-facial coloring of plane graphs
Mickaël Montassier
,
André Raspaud
Information Processing Letters
98
(6), 2006, pp. 235-241
(d,1)
-total labeling of graphs with a given maximum average degree
Mickaël Montassier
,
André Raspaud
Journal of Graph Theory
51
(2), 2006, pp. 93-109
Acyclic and
k
-distance coloring of the grid
Guillaume Fertin
,
Emmanuel Godard
,
André Raspaud
Information Processing Letters
87
(1), 2003, pp. 51-58
On the oriented chromatic number of grids
Guillaume Fertin
,
André Raspaud
,
Arup Roychowdhury
Information Processing Letters
85
(5), 2003, pp. 261-266
Diameter of the Knödel graph
Guillaume Fertin
,
André Raspaud
,
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt̑o
Lecture Notes in Computer Science
1928
, 2000, pp. 149-160
Fulkerson's conjecture and circuit covers
Genghua Fan
,
André Raspaud
Journal of Combinatorial Theory Series B
61
(1), 1994, pp. 133-138