Characterizations of strongly chordal graphs
type: Item
instance of: scholarly article
title: Characterizations of strongly chordal graphs
zbMATH Open document ID: 0514.05048
DOI: 10.1016/0012-365X(83)90154-1
author: Martin Farber
published in: Discrete Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 3811619
zbMATH Keywords: chordal graphs
zbMATH Keywords: forbidden induced subgraph characterization
zbMATH Keywords: totally balanced hypergraphs
zbMATH Keywords: polynomial algorithms
zbMATH Keywords: minimum weight domination
zbMATH Keywords: independent domination
MaRDI profile type: Publication
cites work: Properties of (0,1)-matrices with no triangles
cites work: Hypergraphs with no special cycles
cites work: On rigid circuit graphs
cites work: Domination, independent domination, and duality in strongly chordal graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q3328583
cites work: Parallel concepts in graph theory
cites work: Totally-Balanced and Greedy Matrices
cites work: Q3880849
cites work: Triangulated graphs and the elimination process
cites work: The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
description: scientific article; zbMATH DE number 3811619