Interval Graph

A graph G=(V,E) is an interval graph if it captures the intersection relation for some set of intervals on the real line. Formally, P is an interval graph provided that one can assign to each v in V an interval I_v such that I_u intersection I_v is nonempty precisely when uv in E. An interval graph on a list l can be generated using IntervalGraph[l] in the Wolfram Language package Combinatorica` .

Star graphs are interval graphs, but cycle graphs (for n>=4) are not (Skiena 1990, p. 164). Determining if a graph is an interval graph and realizing it can be done in O(n) time (Booth and Lueker 1976; Skiena 1990, p. 164).

A graph G is an interval graph iff the vertices of G can be ordered v_1, ..., v_n such that v_i adj v_k implies v_j adj k whenever i<j<k (West 2000, p. 346).

Every induced subgraph of an interval graph is itself an interval graph (Jacobson et al. 1991; West 2000, p. 226).

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.