A characterization of strongly chordal graphs

DOI10.1016/S0012-365X(97)00268-9zbMath0956.05090MaRDI QIDQ1584312

Mirka Miller, Elias Dahlhaus, Paul D. Manuel

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

characterizationstrongly chordal graphs

Mathematics Subject Classification ID

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

Related Items (6)

On the complexity of variations of mixed domination on graphs^† ⋮ Boxicity of leaf powers ⋮ Algorithms for generating strongly chordal graphs ⋮ The algorithmic complexity of mixed domination in graphs ⋮ Strengthening strongly chordal graphs ⋮ Odd twists on strongly chordal graphs

Cites Work

• Domination, independent domination, and duality in strongly chordal graphs
• Characterizations of strongly chordal graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Doubly Lexical Orderings of Matrices

This page was built for publication: A characterization of strongly chordal graphs