Martin Charles Golumbic, Ron Shamir: Complexity and algorithms for reasoning about time: A graph-theoretic approach. In: Journal of the ACM (JACM). 40. Jahrgang, Nr.5, 1993, S.1108–1133 (englisch, acm.org).
Richard M. Karp: Mapping the genome: some combinatorial problems arising in molecular biology. twenty-fifth annual ACM symposium on Theory of computing. In: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. ACM, 1993, S.278–285 (englisch, acm.org).
apa.org
psycnet.apa.org
Clyde H. Coombs, J. E. Smith: On the detection of structure in attitudes and developmental processes. In: Psychological Review. 80. Jahrgang, Nr.5, 1973, S.337 (englisch, apa.org).
P. C. Gilmore, A. J. Hoffman: A characterization of comparability graphs and of interval graphs. In: Canadian Journal of Mathematics. 16. Jahrgang, Nr.0, 1. Januar 1964, ISSN1496-4279, S.539–548, doi:10.4153/CJM-1964-055-5 (englisch, math.ca).
Kellogg S. Booth, George S. Lueker: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. In: Journal of Computer and System Sciences. 13. Jahrgang, Nr.3, 1. Dezember 1976, ISSN0022-0000, S.335–379, doi:10.1016/S0022-0000(76)80045-1 (englisch, sciencedirect.com [abgerufen am 21. November 2015]).
infona.pl
C. Lekkeikerker, J. Boland: Representation of a finite graph by a set of intervals on the real line. In: Fundamenta Mathematicae. 1. Jahrgang, Nr.51, 1962, ISSN0016-2736, S.45–64 (englisch, infona.pl).
math.ca
cms.math.ca
P. C. Gilmore, A. J. Hoffman: A characterization of comparability graphs and of interval graphs. In: Canadian Journal of Mathematics. 16. Jahrgang, Nr.0, 1. Januar 1964, ISSN1496-4279, S.539–548, doi:10.4153/CJM-1964-055-5 (englisch, math.ca).
msp.org
David Kendall: Incidence matrices, interval graphs and seriation in archeology. In: Pacific Journal of mathematics. 28. Jahrgang, Nr.3, 1969, S.565–570 (englisch, msp.org).
D. R. Fulkerson, O. A. Gross: Incidence matrices and interval graphs. In: Pacific Journal of Mathematics. 15. Jahrgang, Nr.3, 1965, ISSN0030-8730, S.835–855 (englisch, projecteuclid.org).
Kellogg S. Booth, George S. Lueker: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. In: Journal of Computer and System Sciences. 13. Jahrgang, Nr.3, 1. Dezember 1976, ISSN0022-0000, S.335–379, doi:10.1016/S0022-0000(76)80045-1 (englisch, sciencedirect.com [abgerufen am 21. November 2015]).
zbmath.org
Martin Charles Golumbic: Algorithmic graph theory and perfect graphs. 1980 (englisch, zbmath.org).
P. C. Gilmore, A. J. Hoffman: A characterization of comparability graphs and of interval graphs. In: Canadian Journal of Mathematics. 16. Jahrgang, Nr.0, 1. Januar 1964, ISSN1496-4279, S.539–548, doi:10.4153/CJM-1964-055-5 (englisch, math.ca).
Kellogg S. Booth, George S. Lueker: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. In: Journal of Computer and System Sciences. 13. Jahrgang, Nr.3, 1. Dezember 1976, ISSN0022-0000, S.335–379, doi:10.1016/S0022-0000(76)80045-1 (englisch, sciencedirect.com [abgerufen am 21. November 2015]).
D. R. Fulkerson, O. A. Gross: Incidence matrices and interval graphs. In: Pacific Journal of Mathematics. 15. Jahrgang, Nr.3, 1965, ISSN0030-8730, S.835–855 (englisch, projecteuclid.org).
C. Lekkeikerker, J. Boland: Representation of a finite graph by a set of intervals on the real line. In: Fundamenta Mathematicae. 1. Jahrgang, Nr.51, 1962, ISSN0016-2736, S.45–64 (englisch, infona.pl).