| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418369 | Discrete Applied Mathematics | 2013 | 9 Pages |
Abstract
We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a linear-time algorithm that decides if a given interval graph admits such an intersection representation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Van Bang Le, Dieter Rautenbach,