Dualizing chordal graphs Original Research Article

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.