Graphe representatif de l’hypergraphe h-parti complet

  • Jean-Claude Bermond
Part I: General Hypergraphs
Part of the Lecture Notes in Mathematics book series (LNM, volume 411)


Association Scheme Combinatorial Theory Basis Graph Lattice Graph Nous Noterons 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Aigner: The uniqueness of the cubic lattice graph. J. Combinatorial Theory 6 (1969), 282–297.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    M. Aigner: Note on the characterization of certain association schemes. Ann. Math. Stat. 42 (1971), 363–367.CrossRefzbMATHGoogle Scholar
  3. 3.
    C. Berge: Nombres de coloration de l’hypergraphe h-parti complet, this volume.Google Scholar
  4. 4.
    C. Berge: Graphes et hypergraphes, Dunod, Paris, 1971.zbMATHGoogle Scholar
  5. 5.
    J.A. Bondy: Pancyclic graphs II, J. Combinatorial Theory, (à paraître).Google Scholar
  6. 6.
    W. Cunningham: The matroids of a Basis Graph (à paraître).Google Scholar
  7. 7.
    T.A. Dowling: A characterization of the Tm graph. J. Combinatorial Theory 6 (1969), 251–263.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    T.A. Dowling: Note on "a characterization of cubic lattice graphs". J. Combinatorial Theory 5 (1968), 425–426.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    B. Grünbaum: Incidence patterns of graphs and complexes. The many facets of graph theory; Springer-Verlag, Lecture Notes (110), 115–128.Google Scholar
  10. 10.
    A.J. Hoffman: On the line graph of the complete bipartite graph, Ann. Math. Stat. 35 (1964), 883–885.MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    R. Laskar: A characterization of cubic lattice graphs, J. Combinatorial Theory 3 (1967), 386–401.MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    S.B. Maurer: On matroid basis graphs. Notices Amer. Math. Soc., Août 1972, 617.Google Scholar
  13. 13.
    J.C. Meyer: Quelques problèmes concernant les cliques des hypergraphes h-complets et q-parti h complets, this volume.Google Scholar
  14. 14.
    J. W. Moon: On the line graph of the complete bigraph. Ann. Math. Stat. 34 (1963), 664–667.MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    A.R. Rao: A characterization of a class of regular graphs. J. Combinatorial Theory 10 (1971) 264–274.MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    S.S. Shrikhande: The uniqueness of the L2 association scheme. Ann. Math. Stat. 30 (1959), 781–798.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1974

Authors and Affiliations

  • Jean-Claude Bermond

There are no affiliations available

Personalised recommendations