Block duplicate graphs and a hierarchy of chordal graphs
From MaRDI portal
Publication:1850116
DOI10.1016/S0166-218X(01)00330-4zbMath1011.05051MaRDI QIDQ1850116
Martin Charles Golumbic, Uri N. Peled
Publication date: 2 December 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (8)
The scattering number of strictly chordal graphs: linear time determination ⋮ Strictly interval graphs: characterization and linear time recognition ⋮ Ptolemaic and planar cover-incomparability graphs ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ Strictly chordal graphs: structural properties and integer Laplacian eigenvalues ⋮ New results on Ptolemaic graphs ⋮ Vulnerability of subclasses of chordal graphs ⋮ Non-inclusion and other subclasses of chordal graphs
Cites Work
- Unnamed Item
- Characterizations of strongly chordal graphs
- Neighborhood perfect graphs
- Distance-hereditary graphs
- Structural properties and recognition of restricted and strongly unimodular matrices
- A sufficient condition for a matrix to be totally unimodular
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Restricted unimodular chordal graphs
This page was built for publication: Block duplicate graphs and a hierarchy of chordal graphs
