On minimal vertex separators of dually chordal graphs: properties and characterizations

DOI10.1016/j.dam.2012.02.022zbMath1259.05096OpenAlexW2152925324MaRDI QIDQ1759837

Pablo De Caria, Marisa Gutierrez

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.02.022

zbMATH Keywords

treecliqueneighborhoodchordalseparatordually chordal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (3)

Detour trees ⋮ On the correspondence between tree representations of chordal and dually chordal graphs ⋮ Maxclique and unit disk characterizations of strongly chordal graphs

Cites Work

• On rigid circuit graphs
• Characterizations of strongly chordal graphs
• Algorithmic graph theory and perfect graphs
• Representations of chordal graphs as subtrees of a tree
• A Characterization of Soft Hypergraphs
• Dually Chordal Graphs
• Triangulating Vertex-Colored Graphs
• Clique Graphs of Chordal and Path Graphs

This page was built for publication: On minimal vertex separators of dually chordal graphs: properties and characterizations