Vulnerability of subclasses of chordal graphs

DOI10.1016/J.ENDM.2018.01.007MaRDI QIDQ1742199zbMATH OpenOpenAlexFDO

Authors Nair Abreu, Lilian Markenzon

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)

Recommendations

• Measuring the vulnerability for classes of intersection graphs
• Minimal vertex separators of chordal graphs
• A large class of maximally tough graphs
• Some results on connected vertex separators
• scientific article; zbMATH DE number 1339493

Cites work

• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 7075896 (Why is no real title available?)
• 1-tough cocomparability graphs are hamiltonian
• A Characterization of Block-Graphs
• Algorithmic graph theory and perfect graphs
• Block duplicate graphs and a hierarchy of chordal graphs
• Clique tree generalization and new subclasses of chordal graphs
• Measuring the vulnerability for classes of intersection graphs
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• Ordering trees and graphs with few cycles by algebraic connectivity
• Strictly interval graphs: characterization and linear time recognition
• Tough graphs and Hamiltonian circuits.
• Toughness in graphs -- a survey
• Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms

Cited in

(1)

• The minimum vulnerability problem on specific graph classes

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

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