English

Interval Graphs with Containment Restrictions

Combinatorics 2011-10-03 v1

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 K1,3K_{1,3}. Proskurowski and Telle have studied qq-proper graphs, which are interval graphs having a representation in which no interval is properly contained in more than qq 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 pp-improper interval graphs where no interval contains more than pp other intervals. This paper will focus on a special case of pp-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.

Keywords

Cite

@article{arxiv.1109.6675,
  title  = {Interval Graphs with Containment Restrictions},
  author = {Jeffrey Beyerl and Robert E. Jamison},
  journal= {arXiv preprint arXiv:1109.6675},
  year   = {2011}
}

Comments

12 pages

R2 v1 2026-06-21T19:12:53.734Z