Subgraph trees in graph theory
type: Item
instance of: scholarly article
title: Subgraph trees in graph theory
zbMATH Open document ID: 1023.05033
DOI: 10.1016/S0012-365X(03)00161-4
author: Terry A. McKee
published in: Discrete Mathematics
publication date: 2003-09-04T00:00:00Z
review text: This survey paper discusses in detail the common sort of tree structures determined by selected induced subgraphs. This approach has been useful to study chordal graphs. Generalized clique trees selected, for example, by vertex neighbourhoods made it possible to extend concepts and results from chordal graphs to other graph classes, like---slightly surprisingly---outerplanar graphs. After outlining these concepts, special emphasis to strongly chordal graphs is given.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1974981
zbMATH Keywords: clique trees
zbMATH Keywords: subgraph trees
zbMATH Keywords: chordal graphs
zbMATH Keywords: strongly chordal graphs
zbMATH Keywords: outerplanar graphs
zbMATH Keywords: distance-hereditary graphs
zbMATH Keywords: chordal bipartite graphs
reviewed by: Péter L. Erdős
MaRDI profile type: Publication
cites work: Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
cites work: Distance-hereditary graphs
cites work: Determinantal formulae for matrix completions associated with chordal graphs
cites work: Q3993087
cites work: Power of Natural Semijoins
cites work: Q4764622
cites work: Dually Chordal Graphs
cites work: Homogeneously orderable graphs
cites work: Graph Classes: A Survey
cites work: Graphs whose neighborhoods have no special cycles
cites work: A characterisation of rigid circuit graphs
cites work: Complement reducible graphs
cites work: Incidence graphs of biacyclic hypergraphs
cites work: Characterizations of strongly chordal graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Perfect Elimination and Chordal Bipartite Graphs
cites work: Counting clique trees and computing perfect elimination schemes in parallel
cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
cites work: A characterization of totally balanced hypergraphs
cites work: The leafage of a chordal graph
cites work: Q3880849
cites work: Q4309133
cites work: Strong clique trees, neighborhood trees, and strongly chordal graphs
cites work: Induced cycle structure and outerplanarity
cites work: Q4503097
cites work: Topics in Intersection Graph Theory
cites work: Representing triangulated graphs in stars
cites work: Representations of chordal graphs as subtrees of a tree
full work available at URL: s0012-365x(03)00161-4
OpenAlex ID: W1973457922
description: scientific article; zbMATH DE number 1974981