A characterization of strongly chordal graphs

DOI10.1016/S0012-365X(97)00268-9MaRDI QIDQ1584312zbMATH OpenFDO

Authors Elias Dahlhaus, Paul Manuel, Mirka Miller

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)

Recommendations

• A new characterization of strongly chordal graphs
• Strengthening strongly chordal graphs
• Odd twists on strongly chordal graphs
• Clique graph characterizations of strongly chordal graphs
• scientific article; zbMATH DE number 17505

Cites work

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

Cited in

(25)

• Strong Chordality of Graphs with Possible Loops
• On the complexity of variations of mixed domination on graphs
• Strengthening strongly chordal graphs
• A Dirac-type characterization of \(k\)-chordal graphs
• Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
• Odd twists on strongly chordal graphs
• Boxicity of leaf powers
• Maxclique and unit disk characterizations of strongly chordal graphs
• Characterizing k-chordal unichord-free graphs
• Dually and strongly chordal graphs
• Planarity of strongly chordal graphs
• The graphs that Dahlhaus called ``good generalized strongly chordal
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
• Uncrossed chords of cycles in chordal graphs
• The algorithmic complexity of mixed domination in graphs
• Algorithms for generating strongly chordal graphs
• Clique graph characterizations of strongly chordal graphs
• scientific article; zbMATH DE number 4077265 (Why is no real title available?)
• The i-chords of cycles and paths
• scientific article; zbMATH DE number 17505 (Why is no real title available?)
• Strongly unichord-free graphs
• On strongly chordal graphs that are not leaf powers
• Characterizing s-strongly chordal graphs using 2-paths and k-chords
• Characterizing s-strongly chordal bipartite graphs
• Symmetric graph-theoretic roles of two-pairs and chords of cycles

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

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