Dually and strongly chordal graphs

DOI10.1017/9781108592376.010MaRDI QIDQ5058671zbMATH OpenOpenAlexFDO

Authors Andreas Brandstädt, Martin Charles Golumbic

Publication date 21 December 2022

Full work available at URL https://www.cambridge.org/core/books/topics-in-algorithmic-graph-theory/dually-and-strongly-chordal-graphs/75717EB800201CF0D4F59C47FC7137B9

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Dual-chordal and strongly dual-chordal graphs
• Dually chordal graphs
• Dually Chordal Graphs
• Dualizing chordal graphs
• scientific article; zbMATH DE number 4077265
• A characterization of strongly chordal graphs
• A new characterization of strongly chordal graphs
• scientific article; zbMATH DE number 1230485
• Domination, independent domination, and duality in strongly chordal graphs
• Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs

Cited in

(8)

• On strongly chordal graphs that are not leaf powers
• Dualizing chordal graphs
• Strengthening strongly chordal graphs
• scientific article; zbMATH DE number 4077265 (Why is no real title available?)
• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable 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: Dually and strongly chordal graphs

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