Abstract
Using simplicial decompositions a new and simple proof of Lekkerkerker-Boland’s criterion for interval graphs is given. Also the infinite case is considered, and the problem is tackled to what extent the representation of a graph as an interval graph is unique.
Similar content being viewed by others
References
S. Benzer, On the topology of the genetic fine structure,Proc, Nat. Acad. Sci. U.S.A. 45 (1959), 1607–1620.
D. R. Fulkerson, andO. A. Gross, Incidence matrices and interval graphs,Pacific J. Math. 15 (1965), 835–855.
P. C. Gilmore andA. J. Hoffman, A characterization of comparability graphs and interval graphs,Canad. J. Math. 16 (1964), 539–548.
M. C. Golumbic,Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
G. Hajós, Über eine Art von Graphen,Intern. Math. Nachr. 11, Problem 65 (1957).
A. Hajnal andJ. Surányi, Über die Auflösung von Graphen in vollständige Teilgraphen,Ann. Univ. Sci. Budapestinensis 1 (1958), 113–121.
R. Halin,Graphentheorie II, Wiss. Buchges., Darmstadt, 1981.
C. Lekkerkerker andJ. Boland, Representation of a finite graph by a set of intervals on the real line,Fundam. Math. 51 (1962), 45–64.
Author information
Authors and Affiliations
Additional information
Dedicated to Tibor Gallai on his seventieth birthday