Dualizing chordal graphs

Authors:
Terry A. McKee
Affiliations:
Department of Mathematics and Statistics, Wright State University, Dayton, OH
Venue:
Discrete Mathematics
Year:
2003

Citing 5
Cited 0

Introduction to graph theory

Introduction to graph theory
On the null-homotopy of bridged graphs

European Journal of Combinatorics
Decomposition of 3-connected cubic graphs

Discrete Mathematics - Special issue on combinatorics and algorithms
A characterization of strongly chordal graphs

Discrete Mathematics
Dually Chordal Graphs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

Although chordal graphs may seem at first to be a poor choice to approach using cycle/cutset graph duality, portions of chordal graph theory can be successfully dualized within the context of nonseparable 3-edge-connected graphs. A simple recognition algorithm for such 'dual-chordal graphs' involves the further restriction to 3-connected (necessarily cubic) graphs. There is also a natural notion of strongly dual-chordal graphs, with a simple description for the planar case.