Simple linear time recognition of unit interval graphs

Booth, 1976, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13, 335, 10.1016/S0022-0000(76)80045-1

Deng, 1993

Golumbic, 1980

Hsu, 1993, A simple test for interval graphs, 657, 10

Kleitman, 1990, Computing the bandwidth of interval graphs, SIAM J. Discrete Math., 3, 373, 10.1137/0403033

Korte, 1989, An incremental linear-time algorithm for recognizing interval graphs, SIAM J. Comput., 18, 68, 10.1137/0218005

Looges, 1992, Optimal greedy recognition and coloring for indifference graphs, 127

Manacher, 1990, An optimum Θ(n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals, Inform. Process. Lett., 35, 205, 10.1016/0020-0190(90)90025-S

Rabinovitch, 1977, The Scott-Suppes theorem on semiorders, J. Math. Psych., 15, 209, 10.1016/0022-2496(77)90030-X

Roberts, 1968, Representations of indifference relations

Roberts, 1969, Indifference graphs

Roberts, 1978

Roberts, 1979

Scott, 1958, Foundational aspects of theories of measurement, J. Symbolic Logic, 23, 113, 10.2307/2964389