| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420153 | Discrete Applied Mathematics | 2012 | 9 Pages |
Abstract
We describe a linear time algorithm for the recognition of graphs that have an intersection representation using unit length intervals and single point intervals. Furthermore, we characterize these graphs using forbidden induced subgraphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dieter Rautenbach, Jayme L. Szwarcfiter,