pith. sign in

arxiv: 1109.6675 · v1 · pith:7QMFPGYHnew · submitted 2011-09-29 · 🧮 math.CO

Interval Graphs with Containment Restrictions

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

An interval graph is proper iff it has a representation in which no interval contains another. Fred Roberts characterized the proper interval graphs as those containing no induced star $K_{1,3}$. Proskurowski and Telle have studied $q$-proper graphs, which are interval graphs having a representation in which no interval is properly contained in more than $q$ other intervals. Like Roberts they found that their classes of graphs where characterized, each by a single minimal forbidden subgraph. This paper initiates the study of $p$-improper interval graphs where no interval contains more than $p$ other intervals. This paper will focus on a special case of $p$-improper interval graphs for which the minimal forbidden subgraphs are readily described. Even in this case, it is apparent that a very wide variety of minimal forbidden subgraphs are possible.

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.