pith. sign in

arxiv: 1405.4247 · v1 · pith:Q22Y46U2new · submitted 2014-05-16 · 🧮 math.CO

Unit Mixed Interval Graphs

classification 🧮 math.CO
keywords characterizationgraphsunitalgorithmapproachcontainendpointsextend
0
0 comments X
read the original abstract

In this paper we extend the work of Rautenbach and Szwarcfiter 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, however our approach provides an algorithm that produces such a representation, as well as a forbidden graph characterization.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.