Vulnerability of subclasses of chordal graphs
type: Item
instance of: scholarly article
title: Vulnerability of subclasses of chordal graphs
zbMATH Open document ID: 1388.90115
publication date: 2018-04-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6858343
zbMATH Keywords: vulnerability
zbMATH Keywords: \(k\)-sep chordal graphs
zbMATH Keywords: block graphs
zbMATH Keywords: minimal vertex separators
author: Nair Abreu
author: Lilian Markenzon
MaRDI profile type: Publication
full work available at URL: j.endm.2018.01.007
OpenAlex ID: W2792999372
cites work: Ordering trees and graphs with few cycles by algebraic connectivity
cites work: Toughness in graphs -- a survey
cites work: Q4288578
cites work: Q4967194
cites work: Tough graphs and Hamiltonian circuits.
cites work: 1-tough cocomparability graphs are hamiltonian
cites work: Algorithmic graph theory and perfect graphs
cites work: Block duplicate graphs and a hierarchy of chordal graphs
cites work: A Characterization of Block-Graphs
cites work: Clique tree generalization and new subclasses of chordal graphs
cites work: Measuring the vulnerability for classes of intersection graphs
cites work: One-phase algorithm for the determination of minimal vertex separators of chordal graphs
cites work: Strictly interval graphs: characterization and linear time recognition
cites work: Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
DOI: 10.1016/J.ENDM.2018.01.007
description: scientific article; zbMATH DE number 6858343