Algorithms for generating strongly chordal graphs

DOI10.1007/978-3-662-63170-6_4zbMath1473.68126OpenAlexW3159453235MaRDI QIDQ2233439

Md. Zamilur Rahman, Asish Kumar Mukhopadhyay

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-662-63170-6_4

zbMATH Keywords

graph algorithmschordal graphsstrongly chordal graphsgraph generation

Mathematics Subject Classification ID

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

Related Items (1)

Regular vines with strongly chordal pattern of (conditional) independence

Cites Work

• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• Two methods for the generation of chordal graphs
• \(k\)-tuple domination in graphs
• Characterizations of strongly chordal graphs
• A new characterization of strongly chordal graphs
• A characterization of strongly chordal graphs
• Algorithmic graph theory and perfect graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Linear-Time Generation of Random Chordal Graphs
• A separator-based method for generating weakly chordal graphs

This page was built for publication: Algorithms for generating strongly chordal graphs