MASCOTTE no longer exists => visit the new COATI project-team

Publications of D. Sotteau

Publications of D. Sotteau

Books and proceedings
  1. S. Akl, A. Ferreira, P. Fraigniaud, and D. Sotteau, editors. Parallel Processing Letters -- Special Issue on Algorithmic and Structural Aspects of Interconnection Networks. World Publisher Co., 1994. [bibtex-entry]

Articles in journal or book chapters
  1. J.-C. Bermond, E. Lazard, D. Sotteau, and M. Syska. La Théorie des graphes. Courrier du CNRS, la recherche en informatique, 80:54--55, 1993. [PDF ] [bibtex-entry]

  2. J.-C. Bermond, J. Bond, and D. Sotteau. On regular packings and coverings. Annals of Discrete mathematics, 34:81--100, 1987. [PDF ] [bibtex-entry]

  3. J.-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Longest paths in digraphs. Combinatorica, 1(4):337--341, 1981. [PDF ] [bibtex-entry]

  4. J.-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Girth in digraphs. J. Graph Theory, 4(3):337--341, 1980. [PDF ] [bibtex-entry]

  5. J.-C. Bermond, C. Huang, A. Rosa, and D. Sotteau. Decomposition of complete graphs into isomorphic subgraphs with five vertices. Ars Combin., 10:211--254, 1980. [PDF ] [bibtex-entry]

  6. J.-C. Bermond, D. Sotteau, A. Germa, and M.-C. Heydemann. Chemins et circuits dans les graphes orientés. Ann. Discrete Math., 8:293--309, 1980.
    Note: Présenté au Colloque Combinatorics 79, Univ. Montréal, Montreal, Canada, 1979. [PDF ] [bibtex-entry]

  7. J.-C. Bermond, A. Germa, and D. Sotteau. Resolvable decomposition of $K\sp{\ast} \sb{n}$. J. Combin. Theory Ser. A, 26(2):179--185, 1979. [PDF ] [bibtex-entry]

  8. J.-C. Bermond, C. Huang, and D. Sotteau. Balanced cycle and circuit designs: even cases. Ars Combin., 5:293--318, 1978. [PDF ] [bibtex-entry]

  9. J.-C. Bermond, A. Germa, and D. Sotteau. Hypergraph-designs. Ars Combinatoria, 3:47--66, 1977. [PDF ] [bibtex-entry]

  10. J. C. Bermond, M. C. Heydemann, and D. Sotteau. Line graphs of hypergraphs. I. Discrete Math., 18(3):235--241, 1977. [PDF ] [bibtex-entry]

Conference articles
  1. B. Alspach, J.-C. Bermond, and D. Sotteau. Decomposition into cycles I: Hamilton decompositions. In Proceedings of 1987 Cycles and Rays Colloquium, Montréal, pages 9--18, 1990. NATO ASI Ser. C, Kluwer Academic Publishers, Dordrech PDF = [bibtex-entry]

  2. J.-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Hypergraphes hamiltoniens. In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS, Paris, pages 39--43, 1978. CNRS. [PDF ] [bibtex-entry]

  3. J.-C. Bermond and D. Sotteau. Cycle and circuit designs odd case. In Contributions to graph theory and its applications (Internat. Colloq., Oberhof, 1977) (Germany), Ilmenau, pages 11--32, 1977. Tech. Hochschule Ilmenau. [PDF ] [bibtex-entry]

  4. J.-C. Bermond and D. Sotteau. Graph decompositions and $G$-designs. In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), Winnipeg, Man., pages 53--72. Congressus Numerantium, No. XV, 1976. Utilitas Math.. [PDF ] [bibtex-entry]


Last modified: Thu Oct 10 14:10:03 2013

This document was translated from BibTEX by bibtex2html