Extending partial representations of interval graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Discrete Applied Mathematics
Unit and single point interval graphs
Discrete Applied Mathematics
Hi-index | 0.00 |
A graph is an interval graph if it is the intersection graph of intervals on a line. Interval graphs are known to be the intersection of chordal graphs and asteroidal triple-free graphs, two families where the well-known lexicographic breadth first search (LBFS) plays an important algorithmic and structural role. In this paper we show that interval graphs have a very rich LBFS structure and that by exploiting this structure one can design a linear time, easily implementable, interval graph recognition algorithm.