Strengthening strongly chordal graphs

DOI10.1142/S1793830916500026MaRDI QIDQ2798313zbMATH OpenFDO

Authors Terry A. McKee

Publication date 12 April 2016

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830916500026

zbMATH Keywords

chordal graphchords of a cyclestrongly chordal graphtwo-pair

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4077265
• A characterization of strongly chordal graphs
• A new characterization of strongly chordal graphs
• Dually and strongly chordal graphs
• Clique graph characterizations of strongly chordal graphs
• Algorithms for generating strongly chordal graphs
• Strong Chordality of Graphs with Possible Loops
• Strong chromatic index of chordless graphs
• Strong clique trees, neighborhood trees, and strongly chordal graphs
• Planarity of strongly chordal graphs

Cites work

• A characterization of strongly chordal graphs
• Topics in Intersection Graph Theory

Cited in

(19)

• A new characterization of strongly chordal graphs
• A characterization of strongly chordal graphs
• On strongly chordal graphs that are not leaf powers
• Strongly unichord-free graphs
• Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
• On strictly chordality-\(k\) graphs
• Algorithms for generating strongly chordal graphs
• Fuzzy chordal graphs and its properties
• The i-chords of cycles and paths
• Symmetric graph-theoretic roles of two-pairs and chords of cycles
• Improved algorithms for weakly chordal graphs
• scientific article; zbMATH DE number 4077265 (Why is no real title available?)
• Strong clique trees, neighborhood trees, and strongly chordal graphs
• Odd twists on strongly chordal graphs
• Uncrossed chords of cycles in chordal graphs
• Dual-chordal and strongly dual-chordal graphs
• Strong Chordality of Graphs with Possible Loops
• Characterizing s-strongly chordal graphs using 2-paths and k-chords
• Characterizing s-strongly chordal bipartite graphs

This page was built for publication: Strengthening strongly chordal graphs

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