Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Aigner, Graphs and partial orderings, University of North Carolina Institute of Statistics Mimeo Series No. 600.1.
M. Aigner and G. Prins, Uniquely partially orderable graphs, (to appear).
G. Chartrand, D. Geller and S. Hedetniemi, Graphs with forbidden subgraphs, J. Combinatorial Theory (to appear).
T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar. 18 (1967), 25–66.
A. Ghouilá-Houri, Caractérisation des graphes nonorientés dont on peut orienter les aretes de maniére á obtenir le graphe d'une relation d'ordre, C. R. Acad. Sci. Paris 254 (1962), 1370–1371.
A. Ghouilá-Houri, Flots et tensions dans un graphe, Ann. Scient. Éc. Norm. Sup. 3e s.81 (1964), 207–265.
P.C. Gilmore and A.J. Hoffman, A characterization of comparability graphs and of interval graphs, Canad. J. Math. 16 (1964), 539–548.
B. Grünbaum, Incidence patterns of graphs and complexes, (this volume).
J. Krausz, Démonstration nouvelle d'un théoreme de Whitney sur les réseaux, Math. Fiz. Lapok 50 (1943), 75–85.
C.G. Lekkerkerker and J.C. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math. 51 (1962), 45–64.
R.D. Luce, Semiorders and a theory of utility discrimination, Econometrica 24 (1956), 178–191.
J.A. Mitchem, A Characterization of Hypo-Outerplanar Graphs, Abstract 68T-H3, Notices Amer. Math. Soc. 15 (1968), 813.
F.S. Roberts, Representations of indifference relations, Ph.D. Thesis, Stanford University, 1968.
H. Sachs, On a problem of Shannon concerning perfect graphs and two more results on finite graphs, Waterloo Conference on Combinatorial Mathematics (1968).
D. Scott and P. Suppes, Foundational aspects of theories of measurement, J. Symbolic Logic 23 (1958), 113–128.
J. Sedlaček, Some properties of interchange graphs, Proc. Symp. Smolenice (1963), 145–150.
K. Wagner, Fastplättbare Graphen, J. Combinatorial Theory 3 (1967), 326–365.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1969 Springer-Verlag
About this paper
Cite this paper
Aigner, M. (1969). Graphs and binary relations. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060100
Download citation
DOI: https://doi.org/10.1007/BFb0060100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04629-5
Online ISBN: 978-3-540-36161-9
eBook Packages: Springer Book Archive