Journal of Combinatorics

Volume 3 (2012)

Number 4

Graphs that have clique (partial) 2-trees

Pages: 623 – 632

DOI: http://dx.doi.org/10.4310/JOC.2012.v3.n4.a2

Author

Terry A. McKee (Wright State University, Dayton, Ohio, U.S.A.)

Abstract

Much of the theory—and the applicability—of chordal graphs is based on their being the graphs that have clique trees. Chordal graphs can be generalized to the graphs that have clique representations that are 2-trees, or even series-parallel graphs (partial 2-trees) or outerplanar or maximal outerplanar graphs. The resulting graph classes can be characterized by forbidding contractions of a few induced subgraphs. There is also a plausible application of such graphs to systems biology.

Keywords

clique graph, clique tree, chordal graph, 2-tree, series-parallel

2010 Mathematics Subject Classification

Primary 05C62. Secondary 05C75, 05C90.

Full Text (PDF format)