Department

Computer Science, Mathematics

Document Type

Article

Publication Date

2014

Abstract

In this paper we extend the work of Rautenbach and Szwarcfiter [8] by giving a structural characterization of graphs that can be represented by the intersection of unit intervals that may or may not contain their endpoints. A characterization was proved independently by Joos in [6], however our approach provides an algorithm that produces such a representation, as well as a forbidden graph characterization.

Comments

Post-print version, May 7, 2014. Published version in: Congressus Numerantium, 221: 189-223 (2014).

Version

Post-print

Share

COinS