×

zbMATH — the first resource for mathematics

Raspaud, André

Compute Distance To:
Author ID: raspaud.andre Recent zbMATH articles by "Raspaud, André"
Published as: Raspaud, André; Raspaud, A.; Raspaud, Andre
Documents Indexed: 151 Publications since 1987, including 3 Books
all top 5

Co-Authors

5 single-authored
33 Montassier, Mickaël
20 Wang, Wei-Fan
19 Borodin, Oleg Veniaminovich
19 Chen, Min
17 Sopena, Éric
15 Fertin, Guillaume
14 Kostochka, Aleksandr Vasil’evich
10 Nešetřil, Jaroslav
8 Zhu, Xuding
6 Kerdjoudj, Samia
6 Máčajová, Edita
5 Ivanova, Anna Olegovna
5 Ochem, Pascal
4 Bu, Yuehua
4 Dorbec, Paul
4 Glebov, Alekseĭ Nikolaevich
4 Hocquard, Hervé
4 Kaiser, Tomáš
4 MacGillivray, Gary
4 Škoviera, Martin
4 Sýkora, Ondrej
3 Amar, Denise
3 Barth, Dominique
3 Chang, Gerard Jennhwa
3 Fon-Der-Flaass, Dmitriĭ Germanovich
3 Hell, Pavol
3 Montejano, Amanda
3 Pêcher, Arnaud
3 Pinlou, Alexandre
3 Swarts, Jacobus Stephanus
3 Vrto, Imrich
2 Casselgren, Carl Johan
2 Charpentier, Clément
2 Choi, Ilkyoo
2 Delmas, Olivier
2 DeVos, Matthew
2 Esperet, Louis
2 Godard, Emmanuel
2 Granholm, Jonas B.
2 Hahn, Gena
2 Reed, Bruce Alan
2 Roussel, Nicolas
2 Schröder, Heiko
2 Tarsi, Michael
2 Wang, Yingqian
2 West, Douglas Brent
2 Wu, Jiaojiao
1 Bazzaro, Fabrice
1 Bonamy, Marthe
1 Chen, Dong
1 Comellas, Francesc
1 Cranston, Daniel W.
1 Doyon, Alain
1 Duffy, Christopher
1 Fan, Genghua
1 Fan, Yingying
1 Foucaud, Florent
1 Gauyacq, Ginette
1 Gavoille, Cyril
1 Henning, Michael Anthony
1 Jamshy, Ury
1 Jensen, Tommy René
1 Kim, Hyekyung
1 Kim, Jaehoon
1 Klasing, Ralf
1 Kosowski, Adrian
1 Král’, Daniel
1 Labahn, Roger
1 Li, Chao
1 Löwenstein, Christian
1 Lu, Huajing
1 Micheneau, C.
1 Ordaz, Oscar
1 Ossona de Mendez, Patrice
1 Pangrác, Ondřej
1 Peleg, David
1 Pellegrini, François
1 Pradeep, Kavita
1 Przybyło, Jakub
1 Rollová, Edita
1 Roman, Jean
1 Rong, Lili
1 Roychowdhury, Arup
1 Salavatipour, Mohammad R.
1 Sereni, Jean-Sébastien
1 Shiu, Waichee
1 Stacho, Juraj
1 Toft, Bjarne
1 Togni, Olivier
1 Tong, Li-Da
1 Torok, Lubomir
1 Valicov, Petru
1 Wang, Haichao
1 Woźniak, Mariusz
1 Xu, Jingwei
1 Zhang, Zhongzhi
1 Zhao, Weiliang
1 Zhou, Shuigeng
1 Zirlin, Dara

Publications by Year

Citations contained in zbMATH Open

121 Publications have been cited 1,410 times in 795 Documents Cited by Year
Planar graphs without cycles of length from 4 to 7 are 3-colorable. Zbl 1056.05052
Borodin, O. V.; Glebov, A. N.; Raspaud, A.; Salavatipour, M. R.
69
2005
Good and semi-strong colorings of oriented planar graphs. Zbl 0806.05031
Raspaud, André; Sopena, Eric
58
1994
Star coloring of graphs. Zbl 1055.05051
Fertin, Guillaume; Raspaud, André; Reed, Bruce
50
2004
On the maximum average degree and the oriented chromatic number of a graph. Zbl 0932.05033
Borodin, O. V.; Kostochka, A. V.; Nešetřil, Jaroslav; Raspaud, A.; Sopena, E.
43
1999
Fulkerson’s conjecture and circuit covers. Zbl 0811.05053
Fan, Genghua; Raspaud, André
38
1994
Acyclic list 7-coloring of planar graphs. Zbl 1004.05029
Borodin, O. V.; Fon-Der Flaass, D. G.; Kostochka, A. V.; Raspaud, A.; Sopena, É.
36
2002
Colorings and girth of oriented planar graphs. Zbl 0873.05042
Nešetřil, Jarik; Raspaud, André; Sopena, Eric
34
1997
Acyclic colouring of 1-planar graphs. Zbl 0996.05053
Borodin, O. V.; Kostochka, A. V.; Raspaud, A.; Sopena, E.
31
2001
A sufficient condition for planar graphs to be 3-colorable. Zbl 1023.05046
Borodin, O. V.; Raspaud, A.
29
2003
On the vertex-arboricity of planar graphs. Zbl 1144.05024
Raspaud, André; Wang, Weifan
28
2008
Injective coloring of planar graphs. Zbl 1173.05320
Bu, Yuehua; Chen, Dong; Raspaud, André; Wang, Weifan
26
2009
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\). Zbl 1209.05177
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Ochem, P.; Raspaud, A.
25
2010
Circular flow on signed graphs. Zbl 1408.05068
Raspaud, Andre; Zhu, Xuding
24
2011
Some bounds on the injective chromatic number of graphs. Zbl 1200.05078
Doyon, Alain; Hahn, Geňa; Raspaud, André
23
2010
Acyclic and \(k\)-distance coloring of the grid. Zbl 1175.68293
Fertin, Guillaume; Godard, Emmanuel; Raspaud, André
22
2003
Acyclic 5-choosability of planar graphs without small cycles. Zbl 1114.05037
Montassier, Mickaël; Raspaud, André; Wang, Weifan
22
2007
\((d,1)\)-total labeling of graphs with a given maximum average degree. Zbl 1084.05061
Montassier, Mickaël; Raspaud, André
22
2006
Acyclic 4-choosability of planar graphs withot cycles of specific lengths. Zbl 1120.05034
Montassier, Mickaël; Raspaud, André; Wang, Weifan
21
2006
On the acyclic choosability of graphs. Zbl 1107.05036
Montassier, Mickaël; Ochem, Pascal; Raspaud, André
20
2006
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. Zbl 1184.05024
Borodin, O. V.; Glebov, A. N.; Montassier, M.; Raspaud, A.
19
2009
The chromatic number of a signed graph. Zbl 1329.05116
Máčajová, Edita; Raspaud, André; Škoviera, Martin
18
2016
On strong edge-colouring of subcubic graphs. Zbl 1285.05060
Hocquard, Hervé; Montassier, Mickaël; Raspaud, André; Valicov, Petru
18
2013
Decomposing a graph into forests. Zbl 1237.05167
Montassier, Mickael; de Mendez, Patrice Ossona; Raspaud, André; Zhu, Xuding
18
2012
Colored homomorphisms of colored mixed graphs. Zbl 1026.05047
Nešetřil, Jaroslav; Raspaud, André
17
2000
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Zbl 1209.05216
Raspaud, André; Schröder, Heiko; Sýkora, Ondrej; Torok, Lubomir; Vrt’o, Imrich
17
2009
Generalized power domination of graphs. Zbl 1244.05165
Chang, Gerard Jennhwa; Dorbec, Paul; Montassier, Mickael; Raspaud, André
17
2012
Star coloring of sparse graphs. Zbl 1179.05042
Bu, Yuehua; Cranston, Daniel W.; Montassier, Mickaël; Raspaud, André; Wang, Weifan
17
2009
Linear choosability of graphs. Zbl 1203.05054
Esperet, Louis; Montassier, Mickaël; Raspaud, André
16
2008
\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree. Zbl 1120.05076
Bazzaro, Fabrice; Montassier, Mickaël; Raspaud, André
16
2007
On the oriented chromatic number of grids. Zbl 1173.68604
Fertin, Guillaume; Raspaud, André; Roychowdhury, Arup
15
2003
Antisymmetric flows and strong colourings of oriented graphs. Zbl 0921.05034
Nešetřil, Jaroslav; Raspaud, André
14
1999
Minimum feedback vertex set and acyclic coloring. Zbl 1042.68090
Fertin, Guillaume; Godard, Emmanuel; Raspaud, André
14
2002
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Zbl 1209.05063
Borodin, O. V.; Ivanova, A. O.; Raspaud, A.
14
2010
On star coloring of graphs. Zbl 1042.68628
Fertin, Guillaume; Raspaud, André; Reed, Bruce
14
2001
A survey on Knödel graphs. Zbl 1062.68086
Fertin, Guillaume; Raspaud, André
14
2004
Acyclic 3-choosability of sparse graphs with girth at least 7. Zbl 1213.05049
Borodin, O. V.; Chen, Min; Ivanova, Anna O.; Raspaud, A.
13
2010
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Zbl 1203.05048
Borodin, O. V.; Glebov, A. N.; Raspaud, A.
13
2010
6-star-coloring of subcubic graphs. Zbl 1259.05057
Chen, Min; Raspaud, André; Wang, Weifan
13
2013
Acyclic coloring of graphs of maximum degree five: nine colors are enough. Zbl 1183.05027
Fertin, Guillaume; Raspaud, André
13
2008
On injective colourings of chordal graphs. Zbl 1136.68463
Hell, Pavol; Raspaud, André; Stacho, Juraj
13
2008
Linear coloring of planar graphs with large girth. Zbl 1191.05043
Raspaud, André; Wang, Weifan
12
2009
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable. Zbl 1119.05037
Borodin, O. V.; Glebov, A. N.; Jensen, Tommy R.; Raspaud, Andre
12
2006
Short circuit covers for regular matroids with a nowhere zero 5-flow. Zbl 0659.05038
Jamshy, Ury; Raspaud, Andre; Tarsi, Michael
12
1987
Projective, affine, and abelian colorings of cubic graphs. Zbl 1198.05019
Král’, Daniel; Máčajová, Edita; Pangrác, Ondřej; Raspaud, André; Sereni, Jean-Sébastien; Škoviera, Martin
11
2009
Homomorphisms of 2-edge-colored graphs. Zbl 1221.05156
Montejano, Amanda; Ochem, Pascal; Pinlou, Alexandre; Raspaud, André; Sopena, Éric
11
2010
On acyclic 4-choosability of planar graphs without short cycles. Zbl 1221.05075
Chen, Min; Raspaud, André
11
2010
All-to-all wavelength-routing in all-optical compound networks. Zbl 0977.05132
Amar, D.; Raspaud, A.; Togni, O.
11
2001
Two edge-disjoint hamiltonian cycles in the butterfly graph. Zbl 0807.05047
Barth, Dominique; Raspaud, André
11
1994
Vertex-arboricity of planar graphs without intersecting triangles. Zbl 1250.05062
Chen, Min; Raspaud, André; Wang, Weifan
11
2012
Acyclic 4-choosability of planar graphs. Zbl 1216.05028
Chen, Min; Raspaud, André; Roussel, Nicolas; Zhu, Xuding
11
2011
Strong chromatic index of planar graphs with large girth. Zbl 1303.05063
Jennhwa Chang, Gerard; Montassier, Mickael; Pêcher, Arnaud; Raspaud, André
11
2014
List star edge-coloring of subcubic graphs. Zbl 1392.05040
Kerdjoudj, Samia; Kostochka, Alexandr; Raspaud, André
10
2018
On the size of identifying codes in triangle-free graphs. Zbl 1300.05218
Foucaud, Florent; Klasing, Ralf; Kosowski, Adrian; Raspaud, André
10
2012
Generalized power domination in regular graphs. Zbl 1290.05117
Dorbec, Paul; Henning, Michael A.; Löwenstein, Christian; Montassier, Mickael; Raspaud, André
10
2013
Planar graphs without adjacent cycles of length at most seven are 3-colorable. Zbl 1221.05071
Borodin, Oleg V.; Montassier, Mickael; Raspaud, André
10
2010
Bordeaux 3-color conjecture and 3-choosability. Zbl 1090.05029
Montassier, Mickaël; Raspaud, André; Wang, Weifan
10
2006
On universal graphs for planar oriented graphs of a given girth. Zbl 0956.05041
Borodin, O. V.; Kostochka, A. V.; Nešetřil, J.; Raspaud, A.; Sopena, E.
9
1998
Decomposition of sparse graphs, with application to game coloring number. Zbl 1219.05145
Montassier, Mickael; Pêcher, Arnaud; Raspaud, André; West, Douglas B.; Zhu, Xuding
9
2010
\((k,1)\)-coloring of sparse graphs. Zbl 1238.05084
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A.
9
2012
Some results on the injective chromatic number of graphs. Zbl 1283.90044
Chen, Min; Hahn, Geňa; Raspaud, André; Wang, Weifan
9
2012
On edge-maps whose inverse preserves flows or tensions. Zbl 1114.05098
DeVos, Matt; Nešetřil, Jaroslav; Raspaud, André
9
2007
Planar graphs with girth at least 5 are \((3, 5)\)-colorable. Zbl 1305.05072
Choi, Ilkyoo; Raspaud, André
9
2015
List star edge coloring of sparse graphs. Zbl 1380.05070
Kerdjoudj, Samia; Raspaud, André
8
2018
Acyclic coloring of 1-planar graphs. Zbl 0931.05032
Borodin, O. V.; Kostochka, A. V.; Raspaud, A.; Sopena, E.
8
1999
Routing in recursive circulant graphs: Edge forwarding index and Hamiltonian decomposition. Zbl 0936.68074
Gauyacq, G.; Micheneau, C.; Raspaud, A.
8
1998
Circuit covers of signed graphs. Zbl 1332.05066
Máčajová, Edita; Raspaud, André; Rollová, Edita; Škoviera, Martin
8
2016
On nice graphs. Zbl 0990.05058
Hell, P.; Kostochka, A. V.; Raspaud, A.; Sopena, E.
8
2001
Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Zbl 1262.05029
Chen, Min; Raspaud, André
8
2013
A sufficient condition for planar graphs to be acyclically 5-choosable. Zbl 1242.05089
Chen, Min; Raspaud, André
8
2012
Limits of near-coloring of sparse graphs. Zbl 1280.05040
Dorbec, Paul; Kaiser, Tomáš; Montassier, Mickael; Raspaud, André
7
2014
\((k,j)\)-coloring of sparse graphs. Zbl 1239.05059
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A.
7
2011
Small \(k\)-dominating sets in planar graphs with applications. Zbl 1042.68634
Gavoille, Cyril; Peleg, David; Raspaud, André; Sopena, Eric
7
2001
Cutwidth of the de Bruijn graph. Zbl 0880.05054
Raspaud, André; Sýkora, Ondrej; Vrto, Imrich
6
1995
\(L(p,q)\)-labeling of sparse graphs. Zbl 1295.90097
Charpentier, Clément; Montassier, Mickaël; Raspaud, André
6
2013
Game chromatic number of toroidal grids. Zbl 1197.05055
Raspaud, Andre; Wu, Jiaojiao
6
2009
Perfect matchings with restricted intersection in cubic graphs. Zbl 1218.05137
Kaiser, Tomáš; Raspaud, André
6
2010
On the strong circular 5-flow conjecture. Zbl 1098.05031
Máčajová, Edita; Raspaud, André
6
2006
A note on 2-facial coloring of plane graphs. Zbl 1178.05042
Montassier, Mickaël; Raspaud, André
6
2006
Three-coloring planar graphs without short cycles. Zbl 1185.05057
Chen, Min; Raspaud, André; Wang, Weifan
6
2007
Short cycle covers of graphs and nowhere-zero flows. Zbl 1234.05138
Máčajová, Edita; Raspaud, André; Tarsi, Michael; Zhu, Xuding
6
2011
List star chromatic index of sparse graphs. Zbl 1387.05090
Kerdjoudj, Samia; Pradeep, Kavita; Raspaud, André
5
2018
On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles. Zbl 1300.05073
Chen, Min; Raspaud, André
5
2014
Upper bounds on the linear chromatic number of a graph. Zbl 1210.05045
Li, Chao; Wang, Weifan; Raspaud, André
5
2011
On backbone coloring of graphs. Zbl 1245.90138
Wang, Weifan; Bu, Yuehua; Montassier, Mickaël; Raspaud, André
5
2012
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Zbl 1273.05061
Chen, Min; Raspaud, André
5
2009
An upper bound on adaptable choosability of graphs. Zbl 1209.05094
Montassier, Mickaël; Raspaud, André; Zhu, Xuding
5
2009
List circular coloring of trees and cycles. Zbl 1128.05023
Raspaud, André; Zhu, Xuding
5
2007
On bandwidth, cutwidth, and quotient graphs. Zbl 0881.68089
Barth, Dominique; Pellegrini, François; Raspaud, André; Roman, Jean
4
1995
On deeply critical oriented graphs. Zbl 1025.05024
Borodin, O. V.; Fon-Der-Flaass, D.; Kostochka, A. V.; Raspaud, A.; Sopena, E.
4
2001
A relaxation of Havel’s 3-color problem. Zbl 1185.05062
Montassier, Mickaël; Raspaud, André; Wang, Weifan; Wang, Yingqian
4
2008
Acyclic coloring of graphs of maximum degree \(\Delta \). Zbl 1192.05049
Fertin, Guillaume; Raspaud, André
4
2005
Covering the vertices of a digraph by cycles of prescribed length. Zbl 0764.05070
Amar, D.; Raspaud, A.
4
1991
Non-intersecting perfect matchings in cubic graphs (extended abstract). Zbl 1291.05158
Kaiser, Tomáš; Raspaud, André
4
2007
Strong edge-colorings of sparse graphs with large maximum degree. Zbl 1371.05076
Choi, Ilkyoo; Kim, Jaehoon; Kostochka, Alexandr V.; Raspaud, André
3
2018
Families of graphs having broadcasting and gossiping properties. Zbl 0918.68083
Fertin, Guillaume; Raspaud, André
3
1998
Plane graphs with maximum degree 6 are edge-face 8-colorable. Zbl 1298.05084
Chen, Min; Raspaud, André; Wang, Weifan
3
2014
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Zbl 1209.05092
Lu, Huajing; Wang, Yingqian; Wang, Weifan; Bu, Yuehua; Montassier, Mickaël; Raspaud, André
3
2009
8-star-choosability of a graph with maximum average degree less than 3. Zbl 1283.05087
Chen, Min; Raspaud, André; Wang, Weifan
3
2011
Compatible Eulerian circuits in \(K_ n^{**}\). Zbl 0877.05032
Barth, D.; Bond, J.; Raspaud, A.
3
1995
Covering a graph by forests and a matching. Zbl 1237.05164
Kaiser, Tomáš; Montassier, Mickaël; Raspaud, André
3
2011
Injective edge-coloring of graphs with given maximum degree. Zbl 1466.05072
Kostochka, Alexandr; Raspaud, André; Xu, Jingwei
1
2021
List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs. Zbl 1410.05070
Kerdjoudj, Samia; Raspaud, André
1
2019
Acyclic improper choosability of subcubic graphs. Zbl 1428.05100
Chen, Min; Raspaud, André
1
2019
List star edge-coloring of subcubic graphs. Zbl 1392.05040
Kerdjoudj, Samia; Kostochka, Alexandr; Raspaud, André
10
2018
List star edge coloring of sparse graphs. Zbl 1380.05070
Kerdjoudj, Samia; Raspaud, André
8
2018
List star chromatic index of sparse graphs. Zbl 1387.05090
Kerdjoudj, Samia; Pradeep, Kavita; Raspaud, André
5
2018
Strong edge-colorings of sparse graphs with large maximum degree. Zbl 1371.05076
Choi, Ilkyoo; Kim, Jaehoon; Kostochka, Alexandr V.; Raspaud, André
3
2018
On weight choosabilities of graphs with bounded maximum average degree. Zbl 1358.05165
Przybyło, Jakub; Raspaud, André; Woźniak, Mariusz
2
2017
The chromatic number of a signed graph. Zbl 1329.05116
Máčajová, Edita; Raspaud, André; Škoviera, Martin
18
2016
Circuit covers of signed graphs. Zbl 1332.05066
Máčajová, Edita; Raspaud, André; Rollová, Edita; Škoviera, Martin
8
2016
A \((3,1)^\ast\)-choosable theorem on planar graphs. Zbl 1348.05058
Chen, Min; Raspaud, André; Wang, Weifan
1
2016
Planar graphs with girth at least 5 are \((3, 5)\)-colorable. Zbl 1305.05072
Choi, Ilkyoo; Raspaud, André
9
2015
Strong chromatic index of planar graphs with large girth. Zbl 1303.05063
Jennhwa Chang, Gerard; Montassier, Mickael; Pêcher, Arnaud; Raspaud, André
11
2014
Limits of near-coloring of sparse graphs. Zbl 1280.05040
Dorbec, Paul; Kaiser, Tomáš; Montassier, Mickael; Raspaud, André
7
2014
On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles. Zbl 1300.05073
Chen, Min; Raspaud, André
5
2014
Plane graphs with maximum degree 6 are edge-face 8-colorable. Zbl 1298.05084
Chen, Min; Raspaud, André; Wang, Weifan
3
2014
Star list chromatic number of planar subcubic graphs. Zbl 1291.90282
Chen, Min; Raspaud, André; Wang, Weifan
1
2014
On strong edge-colouring of subcubic graphs. Zbl 1285.05060
Hocquard, Hervé; Montassier, Mickaël; Raspaud, André; Valicov, Petru
18
2013
6-star-coloring of subcubic graphs. Zbl 1259.05057
Chen, Min; Raspaud, André; Wang, Weifan
13
2013
Generalized power domination in regular graphs. Zbl 1290.05117
Dorbec, Paul; Henning, Michael A.; Löwenstein, Christian; Montassier, Mickael; Raspaud, André
10
2013
Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Zbl 1262.05029
Chen, Min; Raspaud, André
8
2013
\(L(p,q)\)-labeling of sparse graphs. Zbl 1295.90097
Charpentier, Clément; Montassier, Mickaël; Raspaud, André
6
2013
Decomposing a graph into forests. Zbl 1237.05167
Montassier, Mickael; de Mendez, Patrice Ossona; Raspaud, André; Zhu, Xuding
18
2012
Generalized power domination of graphs. Zbl 1244.05165
Chang, Gerard Jennhwa; Dorbec, Paul; Montassier, Mickael; Raspaud, André
17
2012
Vertex-arboricity of planar graphs without intersecting triangles. Zbl 1250.05062
Chen, Min; Raspaud, André; Wang, Weifan
11
2012
On the size of identifying codes in triangle-free graphs. Zbl 1300.05218
Foucaud, Florent; Klasing, Ralf; Kosowski, Adrian; Raspaud, André
10
2012
\((k,1)\)-coloring of sparse graphs. Zbl 1238.05084
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A.
9
2012
Some results on the injective chromatic number of graphs. Zbl 1283.90044
Chen, Min; Hahn, Geňa; Raspaud, André; Wang, Weifan
9
2012
A sufficient condition for planar graphs to be acyclically 5-choosable. Zbl 1242.05089
Chen, Min; Raspaud, André
8
2012
On backbone coloring of graphs. Zbl 1245.90138
Wang, Weifan; Bu, Yuehua; Montassier, Mickaël; Raspaud, André
5
2012
The minimum identifying code graphs. Zbl 1278.94095
Raspaud, André; Tong, Li-Da
1
2012
Circular flow on signed graphs. Zbl 1408.05068
Raspaud, Andre; Zhu, Xuding
24
2011
Acyclic 4-choosability of planar graphs. Zbl 1216.05028
Chen, Min; Raspaud, André; Roussel, Nicolas; Zhu, Xuding
11
2011
\((k,j)\)-coloring of sparse graphs. Zbl 1239.05059
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A.
7
2011
Short cycle covers of graphs and nowhere-zero flows. Zbl 1234.05138
Máčajová, Edita; Raspaud, André; Tarsi, Michael; Zhu, Xuding
6
2011
Upper bounds on the linear chromatic number of a graph. Zbl 1210.05045
Li, Chao; Wang, Weifan; Raspaud, André
5
2011
8-star-choosability of a graph with maximum average degree less than 3. Zbl 1283.05087
Chen, Min; Raspaud, André; Wang, Weifan
3
2011
Covering a graph by forests and a matching. Zbl 1237.05164
Kaiser, Tomáš; Montassier, Mickaël; Raspaud, André
3
2011
Obstructions to injective oriented colourings. Zbl 1274.05169
MacGillivray, Gary; Raspaud, André; Swarts, Jacobus
2
2011
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\). Zbl 1209.05177
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Ochem, P.; Raspaud, A.
25
2010
Some bounds on the injective chromatic number of graphs. Zbl 1200.05078
Doyon, Alain; Hahn, Geňa; Raspaud, André
23
2010
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Zbl 1209.05063
Borodin, O. V.; Ivanova, A. O.; Raspaud, A.
14
2010
Acyclic 3-choosability of sparse graphs with girth at least 7. Zbl 1213.05049
Borodin, O. V.; Chen, Min; Ivanova, Anna O.; Raspaud, A.
13
2010
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Zbl 1203.05048
Borodin, O. V.; Glebov, A. N.; Raspaud, A.
13
2010
Homomorphisms of 2-edge-colored graphs. Zbl 1221.05156
Montejano, Amanda; Ochem, Pascal; Pinlou, Alexandre; Raspaud, André; Sopena, Éric
11
2010
On acyclic 4-choosability of planar graphs without short cycles. Zbl 1221.05075
Chen, Min; Raspaud, André
11
2010
Planar graphs without adjacent cycles of length at most seven are 3-colorable. Zbl 1221.05071
Borodin, Oleg V.; Montassier, Mickael; Raspaud, André
10
2010
Decomposition of sparse graphs, with application to game coloring number. Zbl 1219.05145
Montassier, Mickael; Pêcher, Arnaud; Raspaud, André; West, Douglas B.; Zhu, Xuding
9
2010
Perfect matchings with restricted intersection in cubic graphs. Zbl 1218.05137
Kaiser, Tomáš; Raspaud, André
6
2010
Injective oriented colourings. Zbl 1273.05074
MacGillivray, Gary; Raspaud, André; Swarts, Jacobus
3
2010
A note on the acyclic 3-choosability of some planar graphs. Zbl 1220.05040
Hocquard, Hervé; Montassier, Mickaël; Raspaud, André
2
2010
Injective coloring of planar graphs. Zbl 1173.05320
Bu, Yuehua; Chen, Dong; Raspaud, André; Wang, Weifan
26
2009
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. Zbl 1184.05024
Borodin, O. V.; Glebov, A. N.; Montassier, M.; Raspaud, A.
19
2009
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Zbl 1209.05216
Raspaud, André; Schröder, Heiko; Sýkora, Ondrej; Torok, Lubomir; Vrt’o, Imrich
17
2009
Star coloring of sparse graphs. Zbl 1179.05042
Bu, Yuehua; Cranston, Daniel W.; Montassier, Mickaël; Raspaud, André; Wang, Weifan
17
2009
Linear coloring of planar graphs with large girth. Zbl 1191.05043
Raspaud, André; Wang, Weifan
12
2009
Projective, affine, and abelian colorings of cubic graphs. Zbl 1198.05019
Král’, Daniel; Máčajová, Edita; Pangrác, Ondřej; Raspaud, André; Sereni, Jean-Sébastien; Škoviera, Martin
11
2009
Game chromatic number of toroidal grids. Zbl 1197.05055
Raspaud, Andre; Wu, Jiaojiao
6
2009
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Zbl 1273.05061
Chen, Min; Raspaud, André
5
2009
An upper bound on adaptable choosability of graphs. Zbl 1209.05094
Montassier, Mickaël; Raspaud, André; Zhu, Xuding
5
2009
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Zbl 1209.05092
Lu, Huajing; Wang, Yingqian; Wang, Weifan; Bu, Yuehua; Montassier, Mickaël; Raspaud, André
3
2009
On the vertex-arboricity of planar graphs. Zbl 1144.05024
Raspaud, André; Wang, Weifan
28
2008
Linear choosability of graphs. Zbl 1203.05054
Esperet, Louis; Montassier, Mickaël; Raspaud, André
16
2008
Acyclic coloring of graphs of maximum degree five: nine colors are enough. Zbl 1183.05027
Fertin, Guillaume; Raspaud, André
13
2008
On injective colourings of chordal graphs. Zbl 1136.68463
Hell, Pavol; Raspaud, André; Stacho, Juraj
13
2008
A relaxation of Havel’s 3-color problem. Zbl 1185.05062
Montassier, Mickaël; Raspaud, André; Wang, Weifan; Wang, Yingqian
4
2008
Vertex labeling and routing in expanded Apollonian networks. Zbl 1152.90359
Zhang, Zhongzhi; Comellas, Francesc; Fertin, Guillaume; Raspaud, André; Rong, Lili; Zhou, Shuigeng
1
2008
Acyclic 5-choosability of planar graphs without small cycles. Zbl 1114.05037
Montassier, Mickaël; Raspaud, André; Wang, Weifan
22
2007
\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree. Zbl 1120.05076
Bazzaro, Fabrice; Montassier, Mickaël; Raspaud, André
16
2007
On edge-maps whose inverse preserves flows or tensions. Zbl 1114.05098
DeVos, Matt; Nešetřil, Jaroslav; Raspaud, André
9
2007
Three-coloring planar graphs without short cycles. Zbl 1185.05057
Chen, Min; Raspaud, André; Wang, Weifan
6
2007
List circular coloring of trees and cycles. Zbl 1128.05023
Raspaud, André; Zhu, Xuding
5
2007
Non-intersecting perfect matchings in cubic graphs (extended abstract). Zbl 1291.05158
Kaiser, Tomáš; Raspaud, André
4
2007
\(L(p,q)\) labeling of \(d\)-dimensional grids. Zbl 1119.05096
Fertin, Guillaume; Raspaud, André
3
2007
\((d,1)\)-total labeling of graphs with a given maximum average degree. Zbl 1084.05061
Montassier, Mickaël; Raspaud, André
22
2006
Acyclic 4-choosability of planar graphs withot cycles of specific lengths. Zbl 1120.05034
Montassier, Mickaël; Raspaud, André; Wang, Weifan
21
2006
On the acyclic choosability of graphs. Zbl 1107.05036
Montassier, Mickaël; Ochem, Pascal; Raspaud, André
20
2006
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable. Zbl 1119.05037
Borodin, O. V.; Glebov, A. N.; Jensen, Tommy R.; Raspaud, Andre
12
2006
Bordeaux 3-color conjecture and 3-choosability. Zbl 1090.05029
Montassier, Mickaël; Raspaud, André; Wang, Weifan
10
2006
On the strong circular 5-flow conjecture. Zbl 1098.05031
Máčajová, Edita; Raspaud, André
6
2006
A note on 2-facial coloring of plane graphs. Zbl 1178.05042
Montassier, Mickaël; Raspaud, André
6
2006
Planar graphs without cycles of length from 4 to 7 are 3-colorable. Zbl 1056.05052
Borodin, O. V.; Glebov, A. N.; Raspaud, A.; Salavatipour, M. R.
69
2005
Acyclic coloring of graphs of maximum degree \(\Delta \). Zbl 1192.05049
Fertin, Guillaume; Raspaud, André
4
2005
Linear choosability of graphs. Zbl 1192.05048
Esperet, Louis; Montassier, Mickaël; Raspaud, André
1
2005
Abelian colourings of cubic graphs. Zbl 1200.05086
Máčajová, Edita; Raspaud, André; Škoviera, Martin
1
2005
Star coloring of graphs. Zbl 1055.05051
Fertin, Guillaume; Raspaud, André; Reed, Bruce
50
2004
A survey on Knödel graphs. Zbl 1062.68086
Fertin, Guillaume; Raspaud, André
14
2004
Antisymmetric flows and edge-connectivity. Zbl 1031.05062
DeVos, Matt; Nešetřil, Jaroslav; Raspaud, André
3
2004
A sufficient condition for planar graphs to be 3-colorable. Zbl 1023.05046
Borodin, O. V.; Raspaud, A.
29
2003
Acyclic and \(k\)-distance coloring of the grid. Zbl 1175.68293
Fertin, Guillaume; Godard, Emmanuel; Raspaud, André
22
2003
On the oriented chromatic number of grids. Zbl 1173.68604
Fertin, Guillaume; Raspaud, André; Roychowdhury, Arup
15
2003
Acyclic list 7-coloring of planar graphs. Zbl 1004.05029
Borodin, O. V.; Fon-Der Flaass, D. G.; Kostochka, A. V.; Raspaud, A.; Sopena, É.
36
2002
Minimum feedback vertex set and acyclic coloring. Zbl 1042.68090
Fertin, Guillaume; Godard, Emmanuel; Raspaud, André
14
2002
Acyclic colouring of 1-planar graphs. Zbl 0996.05053
Borodin, O. V.; Kostochka, A. V.; Raspaud, A.; Sopena, E.
31
2001
On star coloring of graphs. Zbl 1042.68628
Fertin, Guillaume; Raspaud, André; Reed, Bruce
14
2001
All-to-all wavelength-routing in all-optical compound networks. Zbl 0977.05132
Amar, D.; Raspaud, A.; Togni, O.
11
2001
On nice graphs. Zbl 0990.05058
Hell, P.; Kostochka, A. V.; Raspaud, A.; Sopena, E.
8
2001
Small \(k\)-dominating sets in planar graphs with applications. Zbl 1042.68634
Gavoille, Cyril; Peleg, David; Raspaud, André; Sopena, Eric
7
2001
On deeply critical oriented graphs. Zbl 1025.05024
Borodin, O. V.; Fon-Der-Flaass, D.; Kostochka, A. V.; Raspaud, A.; Sopena, E.
4
2001
Colored homomorphisms of colored mixed graphs. Zbl 1026.05047
Nešetřil, Jaroslav; Raspaud, André
17
2000
...and 21 more Documents
all top 5

Cited by 895 Authors

73 Raspaud, André
45 Wang, Wei-Fan
30 Borodin, Oleg Veniaminovich
29 Montassier, Mickaël
27 Chen, Min
23 Ochem, Pascal
23 Sopena, Éric
23 Zhu, Xuding
21 Pinlou, Alexandre
20 Kostochka, Aleksandr Vasil’evich
20 Máčajová, Edita
20 Wang, Yingqian
20 Yu, Gexin
19 Nešetřil, Jaroslav
17 Bu, Yuehua
16 Škoviera, Martin
15 Ivanova, Anna Olegovna
15 Liu, Guizhen
14 Zhang, Xin
13 Li, Xiangwen
12 Esperet, Louis
12 Wang, Yiqiao
12 Wu, Jian-Liang
12 Xu, Baogang
12 Zhang, Cunquan
10 Hou, Jianfeng
10 Sen, Sagnik
10 Steffen, Eckhard
9 Choi, Ilkyoo
9 Kim, Seog-Jin
9 Vrto, Imrich
9 Wang, Guanghui
8 Chen, Dong
8 Hocquard, Hervé
8 Luo, Rong
8 Naserasr, Reza
8 Škrekovski, Riste
7 Cranston, Daniel W.
7 Dong, Wei
7 Glebov, Alekseĭ Nikolaevich
7 Liu, Runrun
7 Lužar, Borut
7 Mazzuoccolo, Giuseppe
7 Rollová, Edita
7 Soták, Roman
7 Wood, David Ronald
6 Dross, François
6 Dvořák, Zdeněk
6 Dybizbański, Janusz
6 Fan, Genghua
6 Fertin, Guillaume
6 Foucaud, Florent
6 Jin, Ligang
6 Kang, Yingli
6 Marshall, Timothy H.
6 Miao, Lianying
6 Šámal, Robert
6 Torok, Lubomir
5 Bensmail, Julien
5 Chang, Gerard Jennhwa
5 Charpentier, Clément
5 Chen, Ming
5 Harutyunyan, Hovhannes A.
5 Hell, Pavol
5 Jendrol’, Stanislav
5 Kaiser, Tomáš
5 Král’, Daniel
5 Li, Jiaao
5 Liotta, Giuseppe
5 MacGillivray, Gary
5 Miao, Zhengke
5 Ossona de Mendez, Patrice
5 Qian, Jianguo
5 Shao, Zehui
5 West, Douglas Brent
5 Wong, Tsai-Lien
5 Wu, Baoyindureng
5 Yancey, Matthew P.
5 Yang, Daqing
5 Yu, Jiguo
5 Zhu, Enqiang
4 Basavaraju, Manu
4 Borowiecki, Mieczysław
4 Chandran, L. Sunil
4 Czap, Július
4 Duarte, Abraham
4 Duffy, Christopher
4 Gonçalves, Daniel
4 Gravier, Sylvain
4 Havet, Frédéric
4 Ishii, Toshimasa
4 Kang, Ross J.
4 Kerdjoudj, Samia
4 Kim, Jaehoon
4 Klavžar, Sandi
4 Kobourov, Stephen G.
4 Li, Zepeng
4 Lidický, Bernard
4 Lih, Kowei
4 Lin, Wensong
...and 795 more Authors
all top 5

Cited in 97 Serials

165 Discrete Mathematics
84 Discrete Applied Mathematics
48 Journal of Graph Theory
47 European Journal of Combinatorics
45 Information Processing Letters
38 Graphs and Combinatorics
37 Journal of Combinatorial Optimization
28 Journal of Combinatorial Theory. Series B
23 Theoretical Computer Science
19 Discussiones Mathematicae. Graph Theory
16 Discrete Mathematics, Algorithms and Applications
15 SIAM Journal on Discrete Mathematics
14 The Electronic Journal of Combinatorics
13 Applied Mathematics and Computation
13 Acta Mathematica Sinica. English Series
8 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
7 Journal of Discrete Algorithms
5 The Australasian Journal of Combinatorics
5 Science China. Mathematics
4 Combinatorica
4 Acta Mathematicae Applicatae Sinica. English Series
4 Computers & Operations Research
3 Networks
3 Siberian Mathematical Journal
3 Algorithmica
3 International Journal of Computer Mathematics
3 Discrete Mathematics and Theoretical Computer Science. DMTCS
3 AKCE International Journal of Graphs and Combinatorics
3 Frontiers of Mathematics in China
3 Transactions on Combinatorics
2 Proceedings of the American Mathematical Society
2 Applied Mathematics Letters
2 Science in China. Series A
2 Annals of Operations Research
2 Linear Algebra and its Applications
2 Taiwanese Journal of Mathematics
2 Discrete Optimization
2 Sibirskie Èlektronnye Matematicheskie Izvestiya
2 Proyecciones
1 Computers & Mathematics with Applications
1 Houston Journal of Mathematics
1 Indian Journal of Pure & Applied Mathematics
1 Israel Journal of Mathematics
1 Mathematical Notes
1 Acta Mathematica Vietnamica
1 Annales de l’Institut Fourier
1 Journal of Computer and System Sciences
1 Proceedings of the Japan Academy. Series A
1 SIAM Journal on Computing
1 Tokyo Journal of Mathematics
1 Transactions of the American Mathematical Society
1 Bulletin of the Korean Mathematical Society
1 Acta Applicandae Mathematicae
1 Bulletin of the Iranian Mathematical Society
1 Order
1 Optimization
1 Discrete & Computational Geometry
1 Mathematical and Computer Modelling
1 SIAM Journal on Matrix Analysis and Applications
1 Random Structures & Algorithms
1 International Journal of Foundations of Computer Science
1 Designs, Codes and Cryptography
1 Aequationes Mathematicae
1 European Journal of Operational Research
1 Proceedings of the Indian Academy of Sciences. Mathematical Sciences
1 RAIRO. Informatique Théorique et Applications
1 Mathematical Programming. Series A. Series B
1 Foundations of Computing and Decision Sciences
1 Journal of Algebraic Combinatorics
1 Combinatorics, Probability and Computing
1 Numerical Linear Algebra with Applications
1 Journal of Combinatorial Designs
1 Complexity
1 Journal of Heuristics
1 INFORMS Journal on Computing
1 Mathematical Problems in Engineering
1 Theory of Computing Systems
1 Journal of Graph Algorithms and Applications
1 International Journal of Applied Mathematics and Computer Science
1 RAIRO. Theoretical Informatics and Applications
1 RAIRO. Operations Research
1 Archives of Computational Methods in Engineering
1 Journal of Systems Science and Complexity
1 Journal of Applied Mathematics and Computing
1 Central European Journal of Mathematics
1 Contributions to Discrete Mathematics
1 Mathematics in Computer Science
1 Optimization Letters
1 Ars Mathematica Contemporanea
1 Arabian Journal of Mathematics
1 Journal of the Operations Research Society of China
1 Computer Science Review
1 Electronic Journal of Graph Theory and Applications
1 International Journal of Applied and Computational Mathematics
1 Open Mathematics
1 Transactions of the American Mathematical Society. Series B
1 Communications in Combinatorics and Optimization

Citations by Year