Advertisement

Transitiv orientierbare Graphen

  • T. Gallai
Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturverzeichnis

  1. [1]
    G. A. Dirac, Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem,Journal für die reine und angewandte Mathematik,204 (1960), S. 116–131.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [2]
    A. Ghouila-Houri, Caractérisation des graphes non orientés dont on peut orienter les arêtes de manière à obtenir le graphe d'une relation d'ordre,C. R. Acad. Sci. Paris,254 (1962), S. 1370–1371.zbMATHMathSciNetGoogle Scholar
  3. [3]
    A. Ghouila-Houri, Flots et tensions dans un graphe,Ann. scient. Éc. Norm. Sup., 3e s.81 (1964), S. 207–265.MathSciNetGoogle Scholar
  4. [4]
    P. C. Gilmore—A. J. Hoffman, Characterizations of Comparability and Interval Graphs. Abstract,Internat. Congress Mathematicians (Stockholm, 1962), S. 29.Google Scholar
  5. [5]
    P. C. GilmoreA. J. Hoffman, A characterization of comparability graphs and of interval graphs,Can. J. Math.,16 (1964), S. 539–548.zbMATHMathSciNetGoogle Scholar
  6. [6]
    G. Hajós, Über eine Art von Graphen,Intern. Math. Nachr.,11 (1957). Sondernummer 65.Google Scholar
  7. [7]
    C. G. LekkerkerkerJ. Ch. Boland, Representation of a finite graph by a set of intervals in the real line,Fund. Math.,51 (1962), S. 45–64.zbMATHMathSciNetGoogle Scholar

Copyright information

© Akadémiai Kiadó 1967

Authors and Affiliations

  • T. Gallai
    • 1
  1. 1.Budapest

Personalised recommendations