An optimal greedy heuristic to color interval graphs

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

Chvatal, 1987, Four classes of perfectly orderable graphs, J. Graph Theory, 11, 481, 10.1002/jgt.3190110405

Dirac, 1961, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25, 71, 10.1007/BF02992776

Fabri, 1982

Gilmore, 1964, A characterization of comparability graphs and interval graphs, Canad. J. Math., 16, 539, 10.4153/CJM-1964-055-5

Golumbic, 1980

Golumbic, 1980, Macro substitution in Micro Spitbol-a combinatorial analysis, Proc. 11th Southeastern Conference on Combinatorics, Graph Theory and Computing, 29, 485

Jungck, 1982, Computer assisted sequencing, interval graphs, and molecular evolution, Biosystems, 15, 259, 10.1016/0303-2647(82)90010-7

LaPaugh, 1980, A polynomial time algorithm for optimal routing around a rectangle, Proc. 21st Annual IEEE Symposium on Foundations of Computer Science, 282

Lekkerkerker, 1962, Representations of a finite graph by a set of intervals on the line, Fund. Math., 51, 45, 10.4064/fm-51-1-45-64

Lueker, 1979, A linear time algorithm for deciding interval graph isomorphism, J. ACM, 26, 183, 10.1145/322123.322125

Ohtsuki, 1979, One-dimensional logic gate assignment and interval graphs, IEEE Trans. Circuits and Systems, 26, 675, 10.1109/TCS.1979.1084695

Roberts, 1978

Syslo, 1983