Minimal vertex separators and new characterizations for dually chordal graphs

DOI10.1016/J.ENDM.2009.11.022zbMATH Open1268.05169OpenAlexW2057084179MaRDI QIDQ2840528FDOQ2840528

Authors: Pablo De Caria, M. Gutierrez 

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.022

Recommendations

• On minimal vertex separators of dually chordal graphs: properties and characterizations
• Independent separator graphs
• When all minimal \(k\)-vertex separators induce complete or edgeless subgraphs
• Dually Chordal Graphs
• scientific article; zbMATH DE number 17505

zbMATH Keywords

dually chordal graphsminimal separators

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• On rigid circuit graphs
• Representations of chordal graphs as subtrees of a tree
• Coloring mixed hypergraphs: theory, algorithms and applications

Cited In (4)

• How to use the minimal separators of a graph for its chordal triangulation
• A min-max property of chordal bipartite graphs with applications
• On minimal vertex separators of dually chordal graphs: properties and characterizations
• Comparing trees characteristic to chordal and dually chordal graphs

This page was built for publication: Minimal vertex separators and new characterizations for dually chordal graphs

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