Graphs & Applications
Publications of André RASPAUD
(bibtex format)
Copyrights for some of the papers below have been
transfered, or will be transfered to various publishers of journals,
conferences proceedings, etc. For such papers I am required to post the
following notice: This material is presented to ensure timely dissemination
of scholarly and technical work. Copyright and all rights therein are
retained by authors or by other copyright holders. All persons copying
this information are expected to adhere to the terms and constraints
invoked by each author's copyright. Publisher's copyright policy
are available at
© SIAM,
© ACM,
© IEEE,
© Springer,
© Elsevier,
© Ideal,
© King's College.
[
2007 |
2006 |
2005 |
2004 |
2003 |
2002 |
2001 |
2000 |
1999 |
1998 |
1997 |
1996 |
1995 |
1994 |
1993 |
1992 |
1991 |
1987]
2007
- F. Bazzaro, M. Montassier, and A. Raspaud. (d,1)-total labeling of planar graphs with large girth and high maximum degree. Discrete Mathematics, 307:2141-2151, 2007.
- M. Montassier, A. Raspaud, and W. Wang. Acyclic 5-choosability of planar graphs without small cycles. Journal of Graph Theory, 54:245-260, 2007.
- G. Fertin and A. Raspaud. L(p,q) labeling of d-dimensional grids. Discrete Mathematics, 307(16):2132-2140, 2007.
- M. Chen, A. Raspaud, and W. Wang. Three-coloring planar graphs without short cycles. Information Processing Letters, 101:134-138, 2007.
2006
- M. Montassier, A. Raspaud, and W. Wang. Bordeaux 3-color conjecture and 3-choosability. Discrete Mathematics, 306:573-579, 2006.
- M. Montassier, A. Raspaud, and W. Wang. Acyclic 4-choosability of planar graphs without cycles of specific lengths. Algorithms and Combinatorics, Springer, 26:473-491, 2006.
- M. Montassier and A. Raspaud. A note on 2-facial coloring of plane graphs. Information Processing Letters, 98:235-241, 2006.
- M. Montassier and A. Raspaud. (d,1)-total labeling of graphs with a given maximum average degree. J. of Graph Theory, 51:93-109, 2006.
- M. Montassier, P. Ochem, and A. Raspaud. On the acyclic choosability of graphs. J. of Graph Theory, 51:281-300, 2006.
- E. Mácajová and A. Raspaud. On the strong circular 5-flow conjecture. J. of Graph Theory, 52:307-316, 2006.
- D. Gonçalves, A. Raspaud, and M.A. Shalu. On oriented labelling parameters. Formal Models, Languages and Applications,World Scientific, Singapore, 66:33-45, 2006.
- M. DeVos, J. Nesetril, and A. Raspaud. On edge-maps whose inverse preserves flows or tensions. in Graph Theory in Paris (Proceedings of a Conference in Memory of Claude Berge), Trends in Mathematics, Birkhäuser, Basel, pages 109-138, 2006.
2005
- E. Mácajová, A. Raspaud, and M. Skoviera. Abelian colourings of cubic graphs. In 7th International Colloquium on Graph Theory (ICGT'05), volume 22 of Electronic Notes on Discrete Mathematics, pages 333-339. Elsevier, 2005.
- G. Fertin and A. Raspaud. Acyclic coloring of graphs of maximum degree \Delta . In Stefan Felsner, editor, 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), volume AE of DMTCS Proceedings, pages 389-396. Discrete Mathematics and Theoretical Computer Science, 2005.
- L. Esperet, M.Montassier, and A. Raspaud. Linear choosability of graphs. In Stefan Felsner, editor, 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), volume AE of DMTCS Proceedings, pages 99-104. Discrete Mathematics and Theoretical Computer Science, 2005.
- O.V. Borodin, A.N. Glebov, A. Raspaud, and M.R. Salavatipour. Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Combin. Theory Ser. B., 93:303-311, 2005.
2004
- G. Fertin, A. Raspaud, and O. Sýkora. No-hole l(p,0)-labelling of cycles, grids and hypercubes. In Ratislav Kralovic and Ondrej Sýkora, editors, 11th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 3104 of Lecture Notes in Computer Science, pages 138-148. Springer-Verlag, June 2004.
- G. Fertin, A. Raspaud, and B. Reed. Star coloring of graphs. Journal of Graph Theory, 47, No.3:163-182, 2004.
- G. Fertin and A. Raspaud. A survey of Knödel graphs. Discrete Applied Mathematics, 137(2):173-195, 2004.
- M. DeVos, J. Nesetril, and A. Raspaud. Antisymmetric flows and edge-connectivity. Discrete Mathematics, 276:161-167, 2004.
- F. Comellas, G. Fertin, and A. Raspaud. Recursive graphs with small-word scale-free properties. Physical Review E, 69:037104-1,037104-4, 2004.
2003
- F. Comellas, G. Fertin, and A. Raspaud. Vertex labeling and routing in recursive clique-trees, a new family of small-world scale-free graphs. In Jop Sibeyn, editor, 10th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 73-87. Carleton University Press, June 2003.
- G. Fertin, A. Raspaud, and A. Roychowdhury. On the oriented chromatic number of grids. Information Processing Letters, 85:261-266, 2003.
- G. Fertin, E. Godard, and A. Raspaud. Acyclic and k-distance coloring of the grid. Information Processing Letters, 87:51-58, 2003.
- O.V. Borodin and A. Raspaud. A sufficient condition for planar graphs to be 3-colorable. J. Combin. Theory Ser. B., 88:17-27, 2003.
2002
- O.V. Borodin, D. Fon-Der-Flaass, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic list 7-coloring of planar graphs. Journal of Graph Theory, 40, No. 2:83-90, 2002.
- D. Fon-Der-Flaass, A.V. Kostochka, J. Ne setril, A. Raspaud, and E. Sopena. Nilpotent families of endomorphisms of (p(v)^+,\cup). J. Combin. Theory Ser. B., No. 86:100-108, 2002.
- G. Fertin, E. Godard, and A. Raspaud. Minimum feedback vertex set and acyclic coloring. Information Processing Letters, 84:131-139, 2002.
- O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. On the minimum number of colours in acyclic k-strong colorings of maps on surfaces. Matem. zametki (in Russian), 72, No. 1:35-37, 2002.
2001
- G. Fertin and A. Raspaud. k-neighborhood broadcasting. In Francesc Comellas, Josep Fàbrega, and Pierre Fraigniaud, editors, 8th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 133-146. Carleton Scientific, june 2001.
- O.V. Borodin, D. Fon-Der-Flaass, A.V. Kostochka, A. Raspaud, and E. Sopena. On deeply critical oriented graphs. J. Combin. Theory Ser. B., 81, No. 1:150-155, 2001.
- P. Hell, A.V. Kostochka, A. Raspaud, and E. Sopena. On nice graphs. Discrete Math., 234:39-51, 2001.
- C. Gavoille, D. Peleg, A. Raspaud, and E. Sopena. Small k-dominating sets in planar graphs with applications. In 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), volume 2204, pages 201-216. Springer-Verlag, 2001. LNCS.
- G. Fertin, A. Raspaud, and B. Reed. On star coloring of graphs. In 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), volume 2204, pages 140-153. Springer-Verlag, 2001. LNCS.
- G. Fertin and A. Raspaud. Neighborhood communications in networks. In Jaroslav Nesetril, Marc Noy, and Oriol Serra, editors, Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB'01), volume 10 of Electronic Notes on Discrete Mathematics. Elsevier, 2001.
- D. Amar, A. Raspaud, and O. Togni. All-to-all wavelength-routing in all-optical compound networks. Discrete Math., 235:353-363, 2001.
- O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic coloring of 1-planar graphs. Discrete Applied Math., 114, No.1-3:29-41, 2001.
2000
- G. Fertin and A. Raspaud. Gossiping in directed graphs. In Ninth International Conference on Fibonacci Numbers and their Applications, Luxembourg, july 2000.
- A. Raspaud, O. Sýkora, and I. Vrt'o. Congestion and dilatation, similarities and differences: a survey. In Michele Flammini, Enrico Nardelli, Guido Proietti, and Paul Spirakis, editors, 7th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 269-280. Carleton Scientific, June 2000.
- G. Fertin, A. Raspaud, H. Schröder, O. Sýkora, and I. Vrt'o. Diameter of the knödel graph. In 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '00), volume 1928 of Lecture Notes in Computer Science, pages 149-160. Springer-Verlag, June 2000.
- André Raspaud. Proceedings of the Workshop ALTEC-KIT, Saarbrücken, May 1997, volume 245. Theoretical Computer Science, 2000.
- J. Nesetril and A. Raspaud. Colored homomorphisms of colored mixed graphs. J. Combin. Theory Ser. B, 80:147-155, 2000.
- P. Hell, J. Nesetril, A. Raspaud, and E. Sopena. Three and more set theorems. Comment. Math. Univ. Carolin., 41:793-801, 2000.
- G. Fertin and A. Raspaud. Recognizing recursive circulant graphs G(cd^m,d). Research Report RR-1235-00, LaBRI, Université Bordeaux 1, 2000. Submitted for publication.
- O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic k-strong hypergraph coloring of maps on surfaces. Mathematical Note, 67, No. 1:29-35, 2000.
- O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic coloring of 1-planar graphs (russian). Diskretn. Anal. Issled. Oper. Ser.1, 6:20-35, 2000.
1999
- Jean-Claude Bermond, Cyril Gavoille, and André Raspaud. Proceedings of the 6th International Colloquium on Structural Information & Communication Complexity, SIROCCO 6. Carleton Scientific, July 1999.
- J. Nesetril and A. Raspaud. Duality, nowhere-zero flows, coloring and cycle covers. Texte écrit pour l'Ecole de Printemps en Combinatoire (Borová Lada). KAM-DIMATIA Series (Prague), 99-442, 1999.
- J. Nesetril and A. Raspaud. Antisymmetric flows and strong colourings of oriented graphs. Annales de l'Institut Fourier, 49:1037-1056, 1999.
- G. Fertin and A. Raspaud. Minimum gossip digraphs. Research Report RR-1223-99, Laboratoire Bordelais de Recherche en Informatique, 1999.
- O.V. Borodin, A.V. Kostochka, J. Neset ril, A. Raspaud, and E. Sopena. On the maximal average degree and the oriented chromatic number of a graph. Discrete Math., 206:77-89, 1999.
1998
- G. Gauyacq, C. Micheneau, and A.Raspaud. Routing in recursive circulant graphs : edge-forwarding index and hamiltonian decomposition. In Juraj Hromkovic and Ondrej Sýkora, editors, Graph-Theoretic Concepts in Computer Science, WG'98, Lecture Notes in Computer Science, pages 227-241, 1998.
- G. Fertin and A. Raspaud. Families of graphs having broadcasting and gossiping properties. In 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98), volume 1517 of Lecture Notes in Computer Science, pages 63-77. Springer-Verlag, 1998.
- J. Cohen, P. Fraigniaud, J.-C. Konig, and A. Raspaud. Optimized broadcasting and multicasting protocols in cut-through routed networks. IEEE Transactions on Parallel and Distributed Systems, 9:788-802, 1998.
- O.V. Borodin, A.V. Kostochka, J. Neset ril, A. Raspaud, and E. Sopena. On universal graphs for planar oriented graphs of a given girth. Discrete Math., 188:73-85, 1998.
1997
- J. Nesetril, A. Raspaud, and E. Sopena. Colorings and girth of oriented planar graphs. Discrete Math., 165-166:519-530, 1997.
- R. Labahn and A. Raspaud. Periodic gossiping in back-to-back trees. Discrete Applied Math., 75:157-168, 1997.
1996
- D. Amar, O. Ordaz, and A. Raspaud. Hamiltonian properties and the bipartite independence number. Discrete Math., 161:207-215, 1996.
1995
- A. Raspaud, O. Sýkora, and I. Vrt'o. Cutwidth of the de bruijn graph. RAIRO, 29:509-514, 1995.
- D. Barth, F. Pellegrini, A. Raspaud, and J. Roman. On bandwidth, cutwidth and quotient graphs. RAIRO, 29:487-508, 1995.
- D. Barth, J. Bond, and A. Raspaud. Compatible eulerian circuits in k**. Discrete Applied Math, 56:127-136, 1995.
1994
- A. Raspaud and E. Sopena. Good and semi-strong colorings of oriented planar graphs. Information Processing Letters, 51:171-174, 1994.
- D. Barth and A. Raspaud. Two disjoint hamiltonian cycles in the butterfly graph. Information Processing Letters, 51:175-179, 1994.
- G. Fan and A.Raspaud. Fulkerson's conjecture and circuit covers. J. Combin. Theory Ser. B, 61:133-138, 1994.
- J. de Rumeur. Communication dans les réseaux de processeurs. Masson, 1994.
1993
- A. Raspaud. Postman tours and cycle covers. Discrete Math., 111:447-454, 1993.
- A. Raspaud. Good and semi-strong colorings of oriented planar graphs. Bulletin of the EATCS, 50:260-263, 1993.
1992
- A. Raspaud. Short circuit covers for binary matroids with a Petersen flow. Technical Report 92-03, LaBRI, Université Bordeaux I, 1992.
- A. Raspaud. Cycle covers of graphs with the Fulkerson property. In VI Jordanas en teoria de grafos y sus aplicaciones. Cumaná (Venezuela), 1992.
- A. Raspaud. Cycle covers and nowhere-zero flows. In VI Jordanas en teoria de grafos y sus aplicaciones. Cumaná (Venezuela), 1992.
1991
- A. Raspaud. Cycle covers of graphs with a nowhere-zero 4-flow. Journal of Graph Theory, 15(6):649-654, 1991.
- D. Amar and A. Raspaud. Covering the vertices of a digraph by cycles of prescribed length. Discrete Math., 87:111-118, 1991.
1987
- U. Jamshy, A. Raspaud, and M. Tarsi. Short circuit covers for regular matroids with a nowhere zero 5-flow. J. Combin. Theory Ser. B.43, 3:354-357, 1987.
10 janvier 2008 (73)
[home page of the team]