Dualizing chordal graphs

DOI10.1016/S0012-365X(02)00577-0MaRDI QIDQ1869220zbMATH OpenOpenAlexFDO

Authors Terry A. McKee

Publication date 9 April 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00577-0

zbMATH Keywords

dualitystrongly chordal graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Review text

This paper studies dual-chordal graphs, that is, graphs that are dual to chordal graphs with regard to cycle/cutset duality. A characteristic of such graphs is that every cutset with at least four edges is accompanied by a certain kind of edge, a ``cut-chord. One result allows us to recognize dual-chordal graphs by simply looking at cubic graphs. We have a strongly dual-chordal graph if every cutset with at least five edges has a ``strong cut-chord. Among these, the planar ones turn out to be triangular prisms with parallel ``struts or just \(K_4\).

Recommendations

• Dually chordal graphs
• Dually Chordal Graphs
• Dually and strongly chordal graphs
• Dual-chordal and strongly dual-chordal graphs
• Dualizability of graphs
• scientific article; zbMATH DE number 1743828
• scientific article; zbMATH DE number 1230485
• A generalization of chordal graphs
• Chordal graphs
• scientific article; zbMATH DE number 1533810

Cited in

(9)

• Block duplicate graphs and a hierarchy of chordal graphs
• Dualizing distance-hereditary graphs
• Double-crossed chords and distance-hereditary graphs
• Comparing trees characteristic to chordal and dually chordal graphs
• Dualizing cubic graph theory
• Dually Chordal Graphs
• scientific article; zbMATH DE number 1743828 (Why is no real title available?)
• Dually and strongly chordal graphs
• Dual-chordal and strongly dual-chordal graphs

This page was built for publication: Dualizing chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869220)