Vulnerability of subclasses of chordal graphs

DOI10.1016/j.endm.2018.01.007zbMath1388.90115OpenAlexW2792999372MaRDI QIDQ1742199

Lilian Markenzon, Nair Maria Maia De Abreu

Publication date: 11 April 2018

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

zbMATH Keywords

vulnerabilityblock graphsminimal vertex separators\(k\)-sep chordal graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Connectivity (05C40)

Cites Work

• Strictly interval graphs: characterization and linear time recognition
• Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
• Clique tree generalization and new subclasses of chordal graphs
• 1-tough cocomparability graphs are hamiltonian
• Measuring the vulnerability for classes of intersection graphs
• Block duplicate graphs and a hierarchy of chordal graphs
• Algorithmic graph theory and perfect graphs
• Ordering trees and graphs with few cycles by algebraic connectivity
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• A Characterization of Block-Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Vulnerability of subclasses of chordal graphs