TL;DR
This paper extends Roberts' characterization of unit interval graphs to $d$-interval graphs, establishing conditions under which these graphs are characterized by being claw-free, and exploring the differences between disjoint and non-disjoint cases.
Contribution
The paper generalizes Roberts' characterization to $d$-interval graphs, proving new conditions for when such graphs are unit $d$-interval graphs and analyzing class inclusions.
Findings
For any $d \\geq 2$, $K_{1,2d+1}$-free interval graphs are unit $d$-interval graphs.
Disjoint unit $d$-interval graphs form a strict subset of unit $d$-interval graphs.
The classes of disjoint and non-disjoint balanced 2-interval graphs coincide, but differ for $d > 2$.
Abstract
For any natural number , a graph is a (disjoint) -interval graph if it is the intersection graph of (disjoint) -intervals, the union of (disjoint) intervals on the real line. Two important subclasses of -interval graphs are unit and balanced -interval graphs (where every interval has unit length or all the intervals associated to a same vertex have the same length, respectively). A celebrated result by Roberts gives a simple characterization of unit interval graphs being exactly claw-free interval graphs. Here, we study the generalization of this characterization for -interval graphs. In particular, we prove that for any , if is a -free interval graph, then is a unit -interval graph. However, somehow surprisingly, under the same assumptions, is not always a \emph{disjoint} unit -interval graph. This implies that the class…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
