default search action
André Raspaud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j132]Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu:
An (F3, F5)-partition of planar graphs with girth at least 5. Discret. Math. 346(2): 113216 (2023) - 2022
- [j131]Baya Ferdjallah, Samia Kerdjoudj, André Raspaud:
Injective edge-coloring of subcubic graphs. Discret. Math. Algorithms Appl. 14(8): 2250040:1-2250040:22 (2022) - [j130]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): 186-206 (2022) - 2021
- [j129]Carl Johan Casselgren
On star edge colorings of bipartite and subcubic graphs. Discret. Appl. Math. 298: 21-33 (2021) - [j128]Alexandr V. Kostochka, André Raspaud, Jingwei Xu:
Injective edge-coloring of graphs with given maximum degree. Eur. J. Comb. 96: 103355 (2021) - [j127]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): 199-207 (2021) - 2020
- [j126]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)
2010 – 2019
- 2019
- [j125]Min Chen, André Raspaud:
Acyclic improper choosability of subcubic graphs. Appl. Math. Comput. 356: 92-98 (2019) - [j124]Samia Kerdjoudj, André Raspaud:
List star edge-coloring of k-degenerate graphs and K4-minor free graphs. Discret. Appl. Math. 261: 268-275 (2019) - [j123]Christopher Duffy
Oriented incidence colourings of digraphs. Discuss. Math. Graph Theory 39(1): 191-210 (2019) - 2018
- [j122]Samia Kerdjoudj, André Raspaud:
List star edge coloring of sparse graphs. Discret. Appl. Math. 238: 115-125 (2018) - [j121]Samia Kerdjoudj, Kavita Pradeep
List star chromatic index of sparse graphs. Discret. Math. 341(7): 1835-1849 (2018) - [j120]Samia Kerdjoudj, Alexandr V. Kostochka, André Raspaud:
List star edge-coloring of subcubic graphs. Discuss. Math. Graph Theory 38(4): 1037-1054 (2018) - [j119]Ilkyoo Choi
Strong edge-colorings of sparse graphs with large maximum degree. Eur. J. Comb. 67: 21-39 (2018) - 2017
- [j118]Jakub Przybylo
On weight choosabilities of graphs with bounded maximum average degree. Discret. Appl. Math. 217: 663-672 (2017) - [j117]Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud:
Incidence coloring of graphs with high maximum average degree. Discret. Appl. Math. 227: 29-43 (2017) - 2016
- [j116]Edita Mácajová, André Raspaud, Martin Skoviera:
The Chromatic Number of a Signed Graph. Electron. J. Comb. 23(1): 1 (2016) - [j115]Min Chen, André Raspaud, Weifan Wang:
A (3, 1) ∗-choosable theorem on planar graphs. J. Comb. Optim. 32(3): 927-940 (2016) - [j114]Edita Mácajová, André Raspaud, Edita Rollová
Circuit Covers of Signed Graphs. J. Graph Theory 81(2): 120-133 (2016) - 2015
- [j113]Ilkyoo Choi
Planar graphs with girth at least 5 are (3, 5)-colorable. Discret. Math. 338(4): 661-667 (2015) - 2014
- [j112]Min Chen, André Raspaud:
On (3, 2)*-choosability of planar graphs without adjacent short cycles. Discret. Appl. Math. 162: 159-166 (2014) - [j111]Gerard Jennhwa Chang
Strong chromatic index of planar graphs with large girth. Discuss. Math. Graph Theory 34(4): 723-733 (2014) - [j110]Gary MacGillivray, André Raspaud, Jacobus Swarts:
Obstructions to locally injective oriented improper colourings. Eur. J. Comb. 35: 402-412 (2014) - [j109]Min Chen, André Raspaud, Weifan Wang:
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. Graphs Comb. 30(4): 861-874 (2014) - [j108]Min Chen, André Raspaud, Weifan Wang:
Star list chromatic number of planar subcubic graphs. J. Comb. Optim. 27(3): 440-450 (2014) - [j107]Paul Dorbec
Limits of Near-Coloring of Sparse Graphs. J. Graph Theory 75(2): 191-202 (2014) - [i2]Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud:
Incidence coloring of graphs with high maximum average degree. CoRR abs/1412.6803 (2014) - 2013
- [j106]Min Chen, André Raspaud:
Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Discret. Appl. Math. 161(7-8): 921-931 (2013) - [j105]Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov:
On strong edge-colouring of subcubic graphs. Discret. Appl. Math. 161(16-17): 2467-2479 (2013) - [j104]Jaroslav Nesetril
Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 (2012) 685-687]. Eur. J. Comb. 34(7): 1203 (2013) - [j103]Min Chen, André Raspaud:
(3, 1)*-choosability of planar graphs without adjacent short cycles. Electron. Notes Discret. Math. 43: 221-226 (2013) - [j102]Clément Charpentier, Mickaël Montassier, André Raspaud:
L(p, q)-labeling of sparse graphs. J. Comb. Optim. 25(4): 646-660 (2013) - [j101]Min Chen, André Raspaud, Weifan Wang:
6-Star-Coloring of Subcubic Graphs. J. Graph Theory 72(2): 128-145 (2013) - [j100]Paul Dorbec
Generalized Power Domination in Regular Graphs. SIAM J. Discret. Math. 27(3): 1559-1574 (2013) - 2012
- [j99]André Raspaud, Li-Da Tong:
The minimum identifying code graphs. Discret. Appl. Math. 160(9): 1385-1389 (2012) - [j98]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. Discret. Appl. Math. 160(10-11): 1532-1546 (2012) - [j97]Gerard Jennhwa Chang
Generalized power domination of graphs. Discret. Appl. Math. 160(12): 1691-1698 (2012) - [j96]Min Chen, Mickaël Montassier, André Raspaud:
Some structural properties of planar graphs and their applications to 3-choosability. Discret. Math. 312(2): 362-373 (2012) - [j95]Oleg V. Borodin, Anna O. Ivanova
(k, 1)-coloring of sparse graphs. Discret. Math. 312(6): 1128-1135 (2012) - [j94]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): 285-292 (2012) - [j93]Jaroslav Nesetril
Preface. Eur. J. Comb. 33(5): 685-687 (2012) - [j92]Min Chen, André Raspaud, Weifan Wang:
Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33(5): 905-923 (2012) - [j91]Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud:
On backbone coloring of graphs. J. Comb. Optim. 23(1): 79-93 (2012) - [j90]Min Chen, Gena Hahn, André Raspaud, Weifan Wang:
Some results on the injective chromatic number of graphs. J. Comb. Optim. 24(3): 299-318 (2012) - [j89]Mickaël Montassier, Patrice Ossona de Mendez
Decomposing a graph into forests. J. Comb. Theory B 102(1): 38-52 (2012) - [j88]Min Chen, André Raspaud:
A sufficient condition for planar graphs to be acyclically 5-choosable. J. Graph Theory 70(2): 135-151 (2012) - 2011
- [j87]Oleg V. Borodin, Anna O. Ivanova
(k, j)-coloring of sparse graphs. Discret. Appl. Math. 159(17): 1947-1953 (2011) - [j86]Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu:
Acyclic 4-choosability of planar graphs. Discret. Math. 311(1): 92-101 (2011) - [j85]Chao Li, Weifan Wang, André Raspaud:
Upper bounds on the linear chromatic number of a graph. Discret. Math. 311(4): 232-238 (2011) - [j84]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): 97-110 (2011) - [j83]Clément Charpentier, Mickaël Montassier, André Raspaud:
Minmax degree of graphs (Extended abstract). Electron. Notes Discret. Math. 38: 251-257 (2011) - [j82]Gary MacGillivray, André Raspaud, Jacobus Swarts:
Obstructions to Injective Oriented Colourings. Electron. Notes Discret. Math. 38: 597-605 (2011) - [j81]André Raspaud, Xuding Zhu:
Circular flow on signed graphs. J. Comb. Theory B 101(6): 464-479 (2011) - [j80]Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu:
Short cycle covers of graphs and nowhere-zero flows. J. Graph Theory 68(4): 340-348 (2011) - [j79]Tomás Kaiser
Covering a Graph by Forests and a Matching. SIAM J. Discret. Math. 25(4): 1804-1811 (2011) - 2010
- [j78]Hervé Hocquard, Mickaël Montassier, André Raspaud:
A note on the acyclic 3-choosability of some planar graphs. Discret. Appl. Math. 158(10): 1104-1110 (2010) - [j77]Amanda Montejano
Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. 158(12): 1365-1379 (2010) - [j76]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): 167-173 (2010) - [j75]Alain Doyon, Gena Hahn, André Raspaud:
Some bounds on the injective chromatic number of graphs. Discret. Math. 310(3): 585-590 (2010) - [j74]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): 1520-1523 (2010) - [j73]Min Chen, André Raspaud:
On acyclic 4-choosability of planar graphs without short cycles. Discret. Math. 310(15-16): 2113-2118 (2010) - [j72]Oleg V. Borodin, Min Chen, Anna O. Ivanova
Acyclic 3-choosability of sparse graphs with girth at least 7. Discret. Math. 310(17-18): 2426-2434 (2010) - [j71]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): 2584-2594 (2010) - [j70]Min Chen, André Raspaud:
Homomorphisms from sparse graphs to the Petersen graph. Discret. Math. 310(20): 2705-2713 (2010) - [j69]Oleg V. Borodin, Anna O. Ivanova
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Discret. Math. 310(21): 2946-2950 (2010) - [j68]Tomás Kaiser
Perfect matchings with restricted intersection in cubic graphs. Eur. J. Comb. 31(5): 1307-1315 (2010) - [j67]Mickaël Montassier, André Raspaud, Xuding Zhu:
Decomposition of sparse graphs into two forests, one having bounded maximum degree. Inf. Process. Lett. 110(20): 913-916 (2010) - [j66]Oleg V. Borodin, Anna O. Ivanova
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. J. Graph Theory 65(2): 83-93 (2010) - [i1]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. CoRR abs/1010.5975 (2010)
2000 – 2009
- 2009
- [j65]Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang:
Injective coloring of planar graphs. Discret. Appl. Math. 157(4): 663-672 (2009) - [j64]Olivier Delmas, André Raspaud:
Preface. Discret. Math. 309(11): 3463-3464 (2009) - [j63]André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discret. Math. 309(11): 3541-3552 (2009) - [j62]Huajing Lu, Yingqian Wang
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discret. Math. 309(13): 4596-4607 (2009) - [j61]André Raspaud, Weifan Wang:
Linear coloring of planar graphs with large girth. Discret. Math. 309(18): 5678-5686 (2009) - [j60]Daniel Král
Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. 30(1): 53-69 (2009) - [j59]Mickaël Montassier, André Raspaud, Xuding Zhu:
An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30(2): 351-355 (2009) - [j58]Jaroslav Nesetril
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). Electron. Notes Discret. Math. 34: 1-8 (2009) - [j57]Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena:
Chromatic number of sparse colored mixed planar graphs. Electron. Notes Discret. Math. 34: 363-367 (2009) - [j56]Jiaojiao Wu, André Raspaud:
Game chromatic number of toroidal grids. Electron. Notes Discret. Math. 34: 381-385 (2009) - [j55]Min Chen, André Raspaud:
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Electron. Notes Discret. Math. 34: 659-667 (2009) - [j54]André Raspaud, Jiaojiao Wu:
Game chromatic number of toroidal grids. Inf. Process. Lett. 109(21-22): 1183-1186 (2009) - [j53]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 B 99(4): 668-673 (2009) - [j52]Yuehua Bu, Daniel W. Cranston
Star coloring of sparse graphs. J. Graph Theory 62(3): 201-219 (2009) - [c13]Gary MacGillivray, André Raspaud, Jacobus Swarts:
Injective Oriented Colourings. WG 2009: 262-272 - 2008
- [j51]Louis Esperet
Linear choosability of graphs. Discret. Math. 308(17): 3938-3950 (2008) - [j50]André Raspaud, Weifan Wang:
On the vertex-arboricity of planar graphs. Eur. J. Comb. 29(4): 1064-1075 (2008) - [j49]Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena:
Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. 30: 33-38 (2008) - [j48]Guillaume Fertin
Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Inf. Process. Lett. 105(2): 65-72 (2008) - [j47]Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang
A relaxation of Havel's 3-color problem. Inf. Process. Lett. 107(3-4): 107-109 (2008) - [c12]Pavol Hell, André Raspaud, Juraj Stacho:
On Injective Colourings of Chordal Graphs. LATIN 2008: 520-530 - 2007
- [j46]Guillaume Fertin
L(p, q) labeling of d-dimensional grids. Discret. Math. 307(16): 2132-2140 (2007) - [j45]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): 2141-2151 (2007) - [j44]Tomás Kaiser
Non-intersecting perfect matchings in cubic graphs (Extended abstract). Electron. Notes Discret. Math. 28: 293-299 (2007) - [j43]André Raspaud, Nicolas Roussel:
Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract. Electron. Notes Discret. Math. 28: 507-514 (2007) - [j42]Min Chen, André Raspaud, Weifan Wang:
Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101(3): 134-138 (2007) - [j41]Mickaël Montassier, André Raspaud, Weifan Wang:
Acyclic 5-choosability of planar graphs without small cycles. J. Graph Theory 54(3): 245-260 (2007) - [j40]André Raspaud, Xuding Zhu:
List circular coloring of trees and cycles. J. Graph Theory 55(3): 249-265 (2007) - [c11]Daniel Gonçalves
On Oriented Labelling Parameters. Formal Models, Languages and Applications 2007: 34-45 - 2006
- [j39]Mickaël Montassier, André Raspaud, Weifan Wang:
Bordeaux 3-color conjecture and 3-choosability. Discret. Math. 306(6): 573-579 (2006) - [j38]Mickaël Montassier, André Raspaud:
A note on 2-facial coloring of plane graphs. Inf. Process. Lett. 98(6): 235-241 (2006) - [j37]Mickaël Montassier, André Raspaud:
(d, 1)-total labeling of graphs with a given maximum average degree. J. Graph Theory 51(2): 93-109 (2006) - [j36]Mickaël Montassier, Pascal Ochem, André Raspaud:
On the acyclic choosability of graphs. J. Graph Theory 51(4): 281-300 (2006) - [j35]Edita Mácajová, André Raspaud:
On the strong circular 5-flow conjecture. J. Graph Theory 52(4): 307-316 (2006) - 2005
- [j34]Edita Mácajová, André Raspaud, Martin Skoviera:
Abelian Colourings of Cubic Graphs. Electron. Notes Discret. Math. 22: 333-339 (2005) - [j33]Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour:
Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory B 93(2): 303-311 (2005) - 2004
- [j32]Guillaume Fertin
A survey on Knödel graphs. Discret. Appl. Math. 137(2): 173-195 (2004) - [j31]Matt DeVos, Jaroslav Nesetril
Antisymmetric flows and edge-connectivity. Discret. Math. 276(1-3): 161-167 (2004) - [j30]Guillaume Fertin
Star coloring of graphs. J. Graph Theory 47(3): 163-182 (2004) - [c10]Guillaume Fertin, André Raspaud, Ondrej Sýkora:
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. SIROCCO 2004: 138-148 - 2003
- [j29]Guillaume Fertin
On the oriented chromatic number of grids. Inf. Process. Lett. 85(5): 261-266 (2003) - [j28]Guillaume Fertin
Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87(1): 51-58 (2003) - [j27]Oleg V. Borodin, André Raspaud:
A sufficient condition for planar graphs to be 3-colorable. J. Comb. Theory B 88(1): 17-27 (2003) - [c9]Francesc Comellas, Guillaume Fertin, André Raspaud:
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. SIROCCO 2003: 73-87 - 2002
- [j26]Guillaume Fertin
Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3): 131-139 (2002) - [j25]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril
Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory B 86(1): 100-108 (2002) - [j24]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic list 7-coloring of planar graphs. J. Graph Theory 40(2): 83-90 (2002) - 2001
- [j23]Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic colouring of 1-planar graphs. Discret. Appl. Math. 114(1-3): 29-41 (2001) - [j22]Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On nice graphs. Discret. Math. 234(1-3): 39-51 (2001) - [j21]Denise Amar, André Raspaud, Olivier Togni:
All-to-all wavelength-routing in all-optical compound networks. Discret. Math. 235(1-3): 353-363 (2001) - [j20]Guillaume Fertin, André Raspaud:
Neighborhood Communications in Networks. Electron. Notes Discret. Math. 10: 103-108 (2001) - [j19]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On Deeply Critical Oriented Graphs. J. Comb. Theory B 81(1): 150-155 (2001) - [c8]Guillaume Fertin, André Raspaud:
k-Neighborhood Broadcasting. SIROCCO 2001: 133-146 - [c7]Guillaume Fertin, André Raspaud, Bruce A. Reed:
On Star Coloring of Graphs. WG 2001: 140-153 - [c6]Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena:
Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216 - 2000
- [j18]Guillaume Fertin
Recognizing Recursive Circulant Graphs (Extended Abstract). Electron. Notes Discret. Math. 5: 112-115 (2000) - [j17]Jaroslav Nesetril
Colored Homomorphisms of Colored Mixed Graphs. J. Comb. Theory B 80(1): 147-155 (2000) - [c5]André Raspaud, Ondrej Sýkora, Imrich Vrto:
Congestion and dilation, similarities and differences: A survey. SIROCCO 2000: 269-280 - [c4]Guillaume Fertin
Diameter of the Knödel Graph. WG 2000: 149-160
1990 – 1999
- 1999
- [j16]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril
On the maximum average degree and the oriented chromatic number of a graph. Discret. Math. 206(1-3): 77-89 (1999) - [e1]Cyril Gavoille, Jean-Claude Bermond, André Raspaud:
SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999. Carleton Scientific 1999 [contents] - 1998
- [j15]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril
On universal graphs for planar oriented graphs of a given girth. Discret. Math. 188(1-3): 73-85 (1998) - [j14]Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud:
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. IEEE Trans. Parallel Distributed Syst. 9(8): 788-802 (1998) - [c3]Guillaume Fertin, André Raspaud:
Families of Graphs Having Broadcasting and Gossiping Properties. WG 1998: 63-77 - [c2]Ginette Gauyacq, C. Micheneau, André Raspaud:
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition. WG 1998: 227-241 - 1997
- [j13]Roger Labahn, André Raspaud:
Periodic Gossiping in Back-to-back Trees. Discret. Appl. Math. 75(2): 157-168 (1997) - [j12]Jarik Nesetril
Colorings and girth of oriented planar graphs. Discret. Math. 165-166: 519-530 (1997) - [c1]Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud:
Broadcasting and Multicasting in Cut-through Routed Networks. IPPS 1997: 734-738 - 1996
- [j11]Oscar Ordaz, Denise Amar, André Raspaud:
Hamiltonian properties and the bipartite independence number. Discret. Math. 161(1-3): 207-215 (1996) - 1995
- [j10]Dominique Barth, Johny Bond, André Raspaud:
Compatible Eulerian Circuits in Kn**. Discret. Appl. Math. 56(2-3): 127-136 (1995) - [j9]Dominique Barth, François Pellegrini, André Raspaud, Jean Roman:
On Bandwidth, Cutwidth, and Quotient Graphs. RAIRO Theor. Informatics Appl. 29(6): 487-508 (1995) - [j8]André Raspaud, Ondrej Sýkora, Imrich Vrto:
Cutwidth of the Bruijn Graph. RAIRO Theor. Informatics Appl. 29(6): 509-514 (1995) - 1994
- [j7]André Raspaud, Éric Sopena:
Good and Semi-Strong Colorings of Oriented Planar Graphs. Inf. Process. Lett. 51(4): 171-174 (1994) - [j6]Dominique Barth, André Raspaud:
Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph. Inf. Process. Lett. 51(4): 175-179 (1994) - [j5]Genghua Fan, André Raspaud:
Fulkerson's Conjecture and Circuit Covers. J. Comb. Theory B 61(1): 133-138 (1994) - 1993
- [j4]André Raspaud:
Postman tours and cycle covers. Discret. Math. 111(1-3): 447-454 (1993) - 1991
- [j3]Denise Amar, André Raspaud:
Covering the vertices of a digraph by cycles of prescribed length. Discret. Math. 87(2): 111-118 (1991) - [j2]André Raspaud:
Cycle covers of graphs with a nowhere-zero 4-flow. J. Graph Theory 15(6): 649-654 (1991)
1980 – 1989
- 1987
- [j1]Ury Jamshy, André Raspaud, Michael Tarsi:
Short circuit covers for regular matroids with a nowhere zero 5-flow. J. Comb. Theory B 43(3): 354-357 (1987) - 1985
- [b1]André Raspaud:
Flots et couvertures par des cycles dans les graphes et les matroïdes. (Flows and coverings by cycles in graphs and matroids). Joseph Fourier University, Grenoble, France, 1985
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: