Strengthening strongly chordal graphs

DOI10.1142/S1793830916500026zbMATH Open1333.05164MaRDI QIDQ2798313FDOQ2798313

Authors: Terry A. McKee 

Publication date: 12 April 2016

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

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

zbMATH Keywords

chordal graphstrongly chordal graphtwo-pairchords of a cycle

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• Odd twists on strongly chordal graphs
• Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
• A characterization of strongly chordal graphs
• Uncrossed chords of cycles in chordal graphs
• On strictly chordality-\(k\) graphs
• Algorithms for generating strongly chordal graphs
• Title not available (Why is that?)
• The \(i\)-chords of cycles and paths
• Improved algorithms for weakly chordal graphs
• Dual-chordal and strongly dual-chordal graphs
• Strongly unichord-free graphs
• On strongly chordal graphs that are not leaf powers
• Symmetric graph-theoretic roles of two-pairs and chords of cycles
• Strong Chordality of Graphs with Possible Loops

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)