2011•arXiv (Cornell University)Open access

Interval Graphs with Containment Restrictions

Jeffrey Beyerl, Robert E. Jamison

Open full text 3 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Interval graph, Interval (graph theory), Combinatorics, Indifference graph, Mathematics, Discrete mathematics, Pathwidth, Graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Interval Graphs with Containment Restrictions — Research Paper | ScholarLens