
%------ 2007 ---------------------------------------------------------


@Article{BMR07,
  author = 	 {Bazzaro, F. and Montassier, M. and Raspaud, A. },
  title = 	 {(d,1)-total labeling of planar graphs with large girth and high maximum degree.},
 journal = 	 {Discrete Mathematics},
  year = 	 {2007},
  volume="307",
  pages="2141-2151"  
}


@ARTICLE{GF07,
  AUTHOR =       "G.~{Fertin} and A.~{Raspaud}",
  TITLE =        {L(p,q) labeling of d-dimensional grids},
  JOURNAL=  {Discrete Mathematics},
  YEAR =         {2007},
  VOLUME ={307},
  NUMBER = {16},
  PAGES= {2132-2140}
}


@Article{MRW07,
  author = 	 {Montassier, M. and Raspaud, A. and Wang, W.},
  title = 	 {Acyclic 5-choosability of planar graphs without small cycles.},
 journal = 	 {Journal of Graph Theory},
  year = 	 {2007},
  volume="54",
  pages="245-260"  
}


@Article{CRW07,
  author = 	 {Chen, M. and Raspaud, A. and Wang, W.},
  title = 	 {Three-coloring planar graphs without short cycles},
 journal = 	 {Information Processing Letters},
  year = 	 {2007},
  volume="101",
  pages="134-138"  
}


%------ 2006 ---------------------------------------------------------


@Article{DNR06,
 author=  "M.~{DeVos} and J.~{Ne\v set\v ril} and A.~{Raspaud}",
title= {On edge-maps whose inverse
preserves flows or tensions},
journal= {in Graph Theory in Paris (Proceedings of a
Conference in Memory of Claude Berge), Trends in Mathematics, 
Birkh\"auser, Basel}, 
year={2006},
pages= "109-138"
}


@Article{GRS06,
 author= {Gon\c{c}alves, D. and  Raspaud, A. and Shalu, {\mbox{M.A}}.},
title={On Oriented Labelling Parameters},
journal={Formal Models, Languages and Applications,World Scientific, Singapore},
year={2006},
volume="66",
pages= "33-45"
}


@Article{MRW06c,
  author = 	 {Montassier, M. and Raspaud, A. and Wang, W.},
  title = 	 {Acyclic 4-Choosability of Planar Graphs 
without Cycles of Specific lengths},
  journal=  {Algorithms and Combinatorics, Springer},
  year = 	 {2006},
  volume="26",
  pages= "473-491"
}


@Article{EdiAR06,
  author = 	 {{M\'ac\v ajov\'a} , E. and Raspaud, A.},
  title = 	 {On the Strong Circular 5-flow Conjecture},
  journal = 	 {J. of Graph Theory},
  year = 	 {2006},
 volume= "52",
 pages= "307-316"
}


@Article{MR05,
  author = 	 {Montassier, M. and Raspaud, A.},
  title = 	 {A note on 2-facial coloring of plane graphs},
  journal = 	 {Information Processing Letters},
  year = 	 {2006},
  volume="98",
  pages="235-241"
}


@Article{MRW05c,
  author = 	 {Montassier, M. and Raspaud, A. and Wang, W.},
  title = 	 {Bordeaux 3-color Conjecture and 3-choosability},
  journal=  {Discrete Mathematics},
  year = 	 {2006},
  volume="306",
  pages= "573-579"
}


@Article{MOR04,
  author = 	 {Montassier, M. and Ochem, P. and Raspaud, A.},
  title = 	 {On the acyclic choosability of graphs},
  journal = 	 {J. of Graph Theory},
  year = 	 {2006},
 volume= "51",
 pages= "281-300"
}


@ARTICLE{a:MR06,
           author = "M.~{Montassier} and A.~{Raspaud}",
           title = "$(d,1)$-total labeling of graphs with a given maximum average degree",
           journal = {J. of Graph Theory},
           year = "2006",
          volume= "51",
           pages= "93-109"
}


%------ 2005 ---------------------------------------------------------


@inproceedings{DMTCS-AE0175,
   author = {G.~Fertin and A.~Raspaud},
   title = {Acyclic Coloring of Graphs of Maximum Degree {${\Delta }$}},
   keywords = {Acyclic chromatic number, acyclic coloring algorithm, maximum degree},
   editor = {Stefan Felsner},
   booktitle = {2005 European Conference on Combinatorics, 
Graph Theory and Applications (EuroComb '05)},
 series = {DMTCS Proceedings},
  publisher = {Discrete Mathematics and Theoretical Computer Science},
 year = 2005,
 volume = {AE},
 pages = {389-396},
 url = {http://www.dmtcs.org/proceedings/html/dmAE0175.abs.html}
}


@InProceedings{Loui05,
author = {L. Esperet and M.Montassier and A. Raspaud},
   title = {Linear choosability of graphs},
editor = {Stefan Felsner},
   booktitle = {2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
 series = {DMTCS Proceedings},
  publisher = {Discrete Mathematics and Theoretical Computer Science},
 year = 2005,
 volume = {AE},
 pages = {99-104},
 url = {http://www.dmtcs.org/proceedings/html/dmAE0120.abs.html}
}


@InProceedings{Abelian05,
  AUTHOR =      { {M\'a\v cajov\'a}, E.  and Raspaud, A.  and {\v Skoviera}, M.},
  TITLE =        {Abelian Colourings of Cubic Graphs},
  BOOKTITLE =    {7th International Colloquium on Graph Theory (ICGT'05)},
  SERIES =    {Electronic Notes on Discrete Mathematics},
  VOLUME =    {22},
  PAGES =     {333-339 },
  YEAR =         {2005},
  PUBLISHER = {Elsevier}
}


@ARTICLE{a:BGRS05,
           author = "O.V.~{Borodin} and A.N.~{Glebov} and A.~{Raspaud} and M.R.~{Salavatipour}",
           title = "Planar graphs without cycles of length from 4 to 7 are 3-colorable",
           journal = {J. Combin. Theory Ser. B.},
           year = "2005",
          volume= "93",
           pages= "303-311"
}


%------ 2004 ---------------------------------------------------------


@INPROCEEDINGS{FRS04,
     AUTHOR = {Fertin, G. and Raspaud, A. and S\'ykora, O.},
     TITLE = {No-Hole L(p,0)-Labelling of Cycles, Grids and Hypercubes},
     BOOKTITLE = {$11^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)},
     EDITOR = {Ratislav \mbox{Kralovi\v c} and Ondrej  S\'ykora},
     MONTH   ={June},
    YEAR     ={2004},
  PUBLISHER =  {Springer-Verlag},
  VOLUME =   {3104 of Lecture Notes in Computer Science},
  PAGES =  {138-148}
}


@ARTICLE{a:FRR04,
    AUTHOR = { Fertin, G. and Raspaud, A. and Reed, B.},
     TITLE = {Star Coloring of Graphs},
   JOURNAL=  {Journal of Graph Theory},
     YEAR =  {2004},
   VOLUME = {47, No.3},
     PAGES= {163-182}
}


@ARTICLE{a:CFR04,
    AUTHOR = {Comellas, F. and Fertin, G. and Raspaud, A.},
     TITLE = {Recursive graphs with small-word scale-free properties},
   JOURNAL=  {Physical Review E},
     YEAR =  {2004},
   VOLUME = {69},
     PAGES= {037104-1,037104-4}
}


@ARTICLE{a:DNR04,
  AUTHOR =       "M.~{DeVos} and J.~{Ne\v set\v ril} and A.~{Raspaud}",
  TITLE =        {Antisymmetric flows and edge-connectivity},
  JOURNAL=  {Discrete Mathematics},
  YEAR =         {2004},
  VOLUME ={276},
  PAGES= {161-167}
}


@ARTICLE{a:GF04,
  AUTHOR =       "G.~{Fertin} and A.~{Raspaud}",
  TITLE =        {A Survey of {K}n\"odel Graphs},
  JOURNAL=  {Discrete Applied Mathematics},
  YEAR =         {2004},
  VOLUME ={137},
  NUMBER = {2},
  PAGES= {173-195}
}


%------ 2003 ---------------------------------------------------------


@INPROCEEDINGS{CFR03,
    AUTHOR = {Comellas, F. and Fertin, G. and Raspaud, A.},
     TITLE = {Vertex labeling and routing in recursive clique-trees, a new family of small-world scale-free graphs},
 BOOKTITLE = {$10^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)},
 EDITOR = {Sibeyn,Jop},
PUBLISHER = {Carleton University Press},
     MONTH = {June},
      YEAR = {2003},
      PAGES= {73-87}
}


@ARTICLE{a:FGR03, 
           AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.},
           TITLE = {Acyclic and k-distance coloring of the grid},
           JOURNAL = {Information Processing Letters},   
           VOLUME={87},
           YEAR = {2003},
           PAGES= {51-58}
}


@ARTICLE{a:BR2003,
           author = "O.V.~{Borodin} and A.~{Raspaud}",
           title = "A sufficient condition for planar graphs to be 3-colorable",
           journal = {J. Combin. Theory Ser. B.},
           year = "2003",
           volume= "88",
           pages= "17-27"
}


@article{Fertin-On-grids,
author  = "Fertin, G. and Raspaud, A. and Roychowdhury, A.",
title   = "On the oriented chromatic number of grids",
journal = "Information Processing Letters",
volume  = "85",
pages   = "261-266",
year    = "2003"
}


%------ 2002 ---------------------------------------------------------


@ARTICLE{a:RUSBKRS02,
           author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}",
           title = "On the minimum number of colours in acyclic k-strong colorings of maps on surfaces",
           journal = {Matem. zametki (in Russian)},
           year = "2002",
           volume= "72, No. 1",
           pages= "35-37"
}


@ARTICLE{a:FKNRS02,
           author = "D.~{Fon-Der-Flaass} and A.V.~{Kostochka} and J.~{Ne\v set\v ril} and  A.~{Raspaud} and E.~{Sopena}",
           title = "Nilpotent Families of Endomorphisms of $(P(V)^+,\cup)$",
           journal = {J. Combin. Theory Ser. B.},
           year = "2002",
          volume= "No. 86",
           pages= "100-108"
}


@ARTICLE{a:FGR02, 
           AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.},
           TITLE = {Minimum feedback vertex set and acyclic coloring},
           JOURNAL = {Information Processing Letters},   
           VOLUME={84},
           YEAR = {2002},
           PAGES= {131-139}
}


@ARTICLE{a:BFKRS02,
           author = "O.V.~{Borodin} and D. {Fon-Der-Flaass} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}",
           title = "Acyclic List 7-coloring of Planar Graphs",
           journal = {Journal of Graph Theory},
           year = "2002",
           volume= "40, No. 2",
           pages= "83-90"
}


%------ 2001 ---------------------------------------------------------


@InProceedings{KNB_Sirocco,
        AUTHOR             = {Fertin, G. and Raspaud, A.},
        BOOKTITLE          = {$8^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)},
        EDITOR             = {Comellas, Francesc and F\`abrega,Josep and 
Fraigniaud, Pierre},
        PUBLISHER          = {Carleton Scientific},
        MONTH              = {june},
        TITLE              = {$k$-Neighborhood Broadcasting},
        PAGES              = {133-146},
        YEAR               = {2001}
}


@InProceedings{kNeighb_COMB,
  AUTHOR =       {Fertin, G. and Raspaud, A.},
  TITLE =        {Neighborhood Communications in Networks},
  BOOKTITLE =    {Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB'01)},
  VOLUME =    {10},
  editor = {Jaroslav Nesetril and Marc Noy  and Oriol Serra},
  SERIES =    {Electronic Notes on Discrete Mathematics},
  YEAR =         {2001},
  PUBLISHER = {Elsevier}
}


@InProceedings{GPRS01,
  AUTHOR =       {Gavoille, C. and Peleg, D. and Raspaud, A. and Sopena, E.},
  TITLE =        {Small $k$-Dominating Sets in Planar Graphs with Applications },
  BOOKTITLE =      {27th International Workshop on Graph-Theoretic
                  Concepts in Computer Science (WG 2001)}, 
  YEAR =         {2001},
  VOLUME =       {2204},
  PUBLISHER =    {Springer-Verlag},
  NOTE =       {LNCS},
  PAGES =        {201--216}
}


@InProceedings{starWG,
  AUTHOR =       {Fertin, G. and Raspaud, A. and Reed, B.},
  TITLE =        {On Star Coloring of Graphs},
  BOOKTITLE =      {27th International Workshop on Graph-Theoretic
                  Concepts in Computer Science (WG 2001)}, 
  YEAR =         {2001},
  VOLUME =       {2204},
  PUBLISHER =    {Springer-Verlag},
  NOTE =       {LNCS},
  PAGES =        { 140--153 }
}


@ARTICLE{a:HKRS01,
           author = "P. {Hell} and A.V. {Kostochka} and A. {Raspaud} and E. {Sopena}",
           title = "On nice graphs",
           journal = {Discrete Math.},
           year = "2001",
           volume= "234",
           pages= "39-51"
}


@ARTICLE{a:BFKRS01,
           author = "O.V.~{Borodin} and D. {Fon-Der-Flaass} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}",
           title = "On Deeply Critical Oriented Graphs.",
           journal = {J. Combin. Theory Ser. B.},
           year = "2001",
          volume= "81, No. 1",
           pages= "150-155"
}


@ARTICLE{a:RuBKRS01,
           author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}",
           title = " Acyclic Coloring of 1-Planar Graphs.",
           journal = {Discrete Applied Math.},
           year = "2001",
          volume= "114, No.1-3",
           pages= "29-41"
}


@Article{a:ARO99,
  author =       {D. Amar and A. Raspaud and O. Togni},
  title =        {All-to-all Wavelength-routing in all-optical compound networks},
journal= "Discrete Math.",
volume="235", 
year="2001",
pages="353-363"
}


%------ 2000 ---------------------------------------------------------


@InProceedings{FIBO,
  AUTHOR =       "G.~{Fertin} and A.~{Raspaud}",
  TITLE =        {Gossiping in Directed Graphs},
  YEAR =         {2000},
  MONTH=         {july},
  DATE=          {17-22 july 2000},
  ADDRESS=       {Luxembourg},
 booktitle = {Ninth International Conference on Fibonacci Numbers and their Applications}
}


@InProceedings{i:wg2000,
  AUTHOR        = {G. Fertin and A. Raspaud and H. Schr\"{o}der  and
 O. {S\'ykora} and I. {Vrt'o}},
  TITLE         = {Diameter of the Kn\"{o}del Graph},
  BOOKTITLE     = {26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '00)}, 
  MONTH         =jun,
  YEAR          ={2000},
  PUBLISHER =    {Springer-Verlag},
  VOLUME =       {1928 of Lecture Notes in Computer Science},
  PAGES =        {149-160}
}


@InProceedings{i:rvs00,
        AUTHOR             = {A. {Raspaud} and O. {S\'ykora} and I. {Vrt'o}},
        BOOKTITLE          = {$7^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)},
        EDITOR             = {Flammini, Michele and Nardelli, Enrico and Proietti, Guido and Spirakis, Paul},
        PUBLISHER          = {Carleton Scientific},
        MONTH              = jun,
        TITLE              = {Congestion and Dilatation, Similarities and 
Differences: a Survey},
        PAGES              = {269-280},
        YEAR               = {2000}
}


@TechReport{recogn,
  AUTHOR =       "G.~{Fertin} and A.~{Raspaud}",
  TITLE =        {Recognizing Recursive Circulant Graphs {$G(cd^m,d)$}},
  INSTITUTION =  {LaBRI, Universit\'e Bordeaux 1},
  YEAR =         {2000},
  TYPE =         {{Research Report}},
  NUMBER =       {RR-1235-00},
  NOTE =         {Submitted for publication}
}


@BOOK{b:AR2000,
        AUTHOR             = { Raspaud, Andr{\'e}},
        TITLE              = {Proceedings of the Workshop ALTEC-KIT, 
Saarbr\"ucken, May 1997},
        PUBLISHER          = {Theoretical Computer Science},
        VOLUME             ="245",
        YEAR               = {2000}
}


@ARTICLE{a:RuBKRS00,
           author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}",
           title = " Acyclic Coloring of 1-Planar Graphs (Russian).",
           journal = {Diskretn. Anal. Issled. Oper. Ser.1},
           year = "2000",
          volume= "6",
           pages= "20-35"
}


@Article{a:HNRS00,
           author = "P. {Hell} and J. {Ne\v set\v ril} and A. {Raspaud} and E. {Sopena}",
           title = "Three and more Set Theorems",
           journal = "Comment. Math. Univ. Carolin.",
           year = {2000},
	   volume = "41", 
	   pages = "793-801"
}


@ARTICLE{a:nesra98,
	   author = "J. {Ne\v set\v ril} and A. {Raspaud}",
	   title = "Colored Homomorphisms of Colored Mixed Graphs.",
	   journal ={J. Combin. Theory Ser. B},
      volume="80",
      year= "2000", 
      pages="147-155"
}


@ARTICLE{a:BKRS00,
           author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}",
           title = " Acyclic k-strong hypergraph coloring of maps on surfaces. ",
           journal = {Mathematical Note},
           year = "2000",
          volume= "67, No. 1",
           pages= "29-35"
}


%------ 1999 ---------------------------------------------------------


@BOOK{b:BGR99,
        AUTHOR             = {Bermond, Jean-Claude and Gavoille, Cyril and Raspaud, Andr{\'e}},
        TITLE              = {Proceedings of the $6^{th}$ International Colloquium on Structural Information \& Communication Complexity, SIROCCO 6},
        PUBLISHER          = {Carleton Scientific},
        MONTH              = jul,
        YEAR               = {1999}
}


@ARTICLE{RN99,
        AUTHOR             = "J.~{Ne\v set\v ril} and A.~{Raspaud} ",
        JOURNAL            = {Texte \'ecrit pour l'Ecole de Printemps en Combinatoire (Borov\'a Lada). KAM-DIMATIA Series (Prague) },
        TITLE              = {Duality, Nowhere-Zero Flows, Coloring and Cycle covers},
        VOLUME             ="99-442",
        YEAR               = {1999}
}


@TechReport{fertin-mgd,
  AUTHOR =       {Fertin, G. and Raspaud, A.},
  TITLE =        {Minimum Gossip Digraphs},
  INSTITUTION =  {Laboratoire Bordelais de Recherche en Informatique},
  YEAR =         {1999},
  TYPE =         {{Research Report}},
  NUMBER =       {RR-1223-99},
{ftp://ftp.labri.u-bordeaux.fr/pub/Local/Info/Publications/Rapports-internes/RR-122399.ps.gz}
}


@ARTICLE{a:NESRAS99,
author = "J.~{Ne\v set\v ril} and A.~{Raspaud} ",
           title = " Antisymmetric Flows and Strong Colourings of Oriented Graphs.",
           journal = {Annales de l'Institut Fourier},
           year = "1999",
          volume= "49",
           pages= "1037-1056"
}


@ARTICLE{a:BKRS96a,
           author = "O.V.~{Borodin} and A.V.~{Kostochka} and J.~{Ne\v set\v ril} 
and A.~{Raspaud} and E.~{Sopena}",
           title = "On the Maximal Average Degree and the Oriented Chromatic 
Number of a Graph.",
           journal = {Discrete Math.},
           year = "1999",
          volume= "206",
           pages= "77-89"
}


%------ 1998 ---------------------------------------------------------


@InProceedings{famfertin,
  AUTHOR =       {Fertin, G. and Raspaud, A.},
  TITLE =        {Families of Graphs having Broadcasting and Gossiping Properties},
  BOOKTITLE =    {24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98)}, 
  YEAR =         {1998},
  PUBLISHER =    {Springer-Verlag},
  VOLUME =       {1517 of Lecture Notes in Computer Science},
  PAGES =        {63-77}
}


@InProceedings{GMR98,
  author =       "G. {Gauyacq} and C.{ Micheneau} and A.{Raspaud} ", 
  title =         "Routing in recursive circulant graphs : edge-forwarding index and Hamiltonian decomposition",
  booktitle =    {Graph-Theoretic Concepts in Computer Science, WG'98},
  editor =    {Juraj Hromkovic and Ondrej  S\'ykora},
  series =    {Lecture Notes in Computer Science},
  year      =    1998,
  pages =     {227-241}
}


@ARTICLE{a:CFKR98,
           author ="J.~{Cohen} and P.~ {Fraigniaud} and J.-C.~{Konig} and A.~{Raspaud}", 
           title="Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.",
           journal = {IEEE Transactions on Parallel and Distributed Systems},
           year="1998",
           volume= "9",
           pages="788-802"
}


@ARTICLE{a:BKRS96b,
           author = "O.V.~{Borodin} and A.V.~{Kostochka} and J.~{Ne\v set\v ril} and A.~{Raspaud} and E.~{Sopena}",
           title = "On universal graphs for planar oriented graphs of a given girth.",
           journal = {Discrete Math.},
           year = "1998",
          volume= "188",
           pages= "73-85"
}


%------ 1997 ---------------------------------------------------------


@ARTICLE{a:RL94a,
           author = "R. {Labahn} and A. {Raspaud}   ",
           title = "Periodic Gossiping in Back-To-Back Trees",
           journal = {Discrete Applied Math.},
            year = "1997" ,
           volume= "75",
           pages= "157-168"
}


@Article{d:nrs95,
           author = "J. {Ne\v set\v ril} and A. {Raspaud} and E. {Sopena}",
           title = "Colorings and girth of oriented planar graphs",
           journal = "Discrete Math.",
           year = {1997},
	   volume = "165-166", 
	   pages = "519-530"
}


%------ 1996 ---------------------------------------------------------


@Article{a:RAO96a,
           author = "D. {Amar}  and O. {Ordaz} and A. {Raspaud} ",
           title = "Hamiltonian properties and the bipartite independence
number ",
           journal = "Discrete Math.",
           year = "1996",
           volume= "161",
           pages= "207-215"
}


%------ 1995 ---------------------------------------------------------


@ARTICLE{a:bprr95,
        AUTHOR             = {D. {Barth} and F. {Pellegrini} and A. {Raspaud} and J. {Roman}},
        JOURNAL            = {RAIRO},
        PAGES              = {487-508},
        TITLE              = {On bandwidth, cutwidth and quotient graphs},
        VOLUME             = {29},
        YEAR               = {1995}
}


@ARTICLE{a:bbr95,
        AUTHOR             = {D. {Barth} and J. {Bond} and A. {Raspaud}},
        JOURNAL            = {Discrete Applied Math},
        PAGES              = {127-136},
        TITLE              = {Compatible eulerian circuits in K**},
        VOLUME             = {56},
        YEAR               = {1995}
}


@ARTICLE{a:rvs95,
        AUTHOR             = {A. {Raspaud} and O. {S\'ykora} and I. {Vrt'o}},
        JOURNAL            = {RAIRO},
        PAGES              = {509-514},
        TITLE              = {Cutwidth of the de Bruijn graph},
        VOLUME             = {29},
        YEAR               = {1995}
}


%------ 1994 ---------------------------------------------------------


@Book{l:Rum94a,
           author = "J. {de Rumeur} ",
           title = "Communication dans les r\'eseaux de processeurs",
           publisher = "Masson",
           year = "1994"
}


@Article{a:FR94,
      author= {G. Fan and A.Raspaud},
      title= {Fulkerson's conjecture and circuit covers.},
      journal= {J. Combin. Theory Ser. B},
      volume="61",
      year= "1994", 
      pages="133-138"
}


@Article{a:RS94,
           author = "A. {Raspaud}  and E. {Sopena}",
           title = "Good and semi-strong colorings of oriented planar graphs",
           journal = "Information Processing Letters",
           year = "1994", 
           volume = "51", 
           pages = "171-174"
}


@Article{a:BR94a,
           author = "D. {Barth}  and A. {Raspaud}  ",
           title = "Two Disjoint Hamiltonian Cycles in the Butterfly Graph",
           journal = "Information Processing Letters",
           year = "1994", 
           volume = "51", 
           pages = "175-179"
}


%------ 1993 ---------------------------------------------------------


@Article{a:R93,
           author = "A. {Raspaud}",
           title = "Good and semi-strong colorings of oriented planar graphs",
           journal = "Bulletin of the EATCS",
           year = "1993", 
           volume = "50", 
           pages = "260-263"
}


@Article{a:Ras93b,
           author = "A. {Raspaud}  ",
           title = "Postman tours and cycle covers ",
           journal = "Discrete Math.",
           year = "1993", 
           volume = "111", 
           pages = "447-454"
}


%------ 1992 ---------------------------------------------------------


@InProceedings{i:Ras92c,
  author =       "A. {Raspaud}",
  title =        "Cycle Covers of Graphs with the {Fulkerson} Property",
  year =         "1992",
    booktitle = "VI Jordanas en teoria de grafos y sus aplicaciones. Cuman\'a (Venezuela)"
}


@InProceedings{i:Ras92b,
  author =       "A. {Raspaud}",
  title =        "Cycle Covers and Nowhere-zero Flows",
  year =         "1992",
  booktitle = "VI Jordanas en teoria de grafos y sus aplicaciones. Cuman\'a (Venezuela)"
}


@TechReport{d:Ras92a,
           author = "A. {Raspaud}  ",
           title = "Short Circuit Covers for Binary Matroids with a {P}etersen Flow",
           Institution = "LaBRI, Universit\'e Bordeaux I",
           year = "1992",
           number="92-03"
}


%------ 1991 ---------------------------------------------------------


@Article{a:Ras91b,
           author = "A. {Raspaud}  ",
           title = "Cycle covers of graphs with a nowhere-zero 4-flow. ",
           journal = "Journal of Graph Theory",
           year = "1991", 
           volume = "15",
           number="6", 
           pages = "649-654"
}


@Article{a:AR91,
author = {D. Amar and A. Raspaud},
title=  {Covering the vertices of a digraph by cycles of prescribed length.},
journal= "Discrete Math.",
volume="87", 
year="1991",
pages="111-118"
}


%------ 1987 ---------------------------------------------------------


@ARTICLE{a:JRT,
           author = "U. {Jamshy} and  A. {Raspaud}  and M. {Tarsi}",
           title = "Short circuit covers for regular matroids with a nowhere zero 5-flow.",
           journal = {J. Combin. Theory Ser. B.43},
            year = "1987" ,
           volume= "3",
           pages= "354--357"
}

