Subgraph trees in graph theory
From MaRDI portal
Publication:1406544
DOI10.1016/S0012-365X(03)00161-4zbMath1023.05033OpenAlexW1973457922MaRDI QIDQ1406544
Publication date: 4 September 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00161-4
distance-hereditary graphsouterplanar graphschordal graphsclique treeschordal bipartite graphsstrongly chordal graphssubgraph trees
Related Items
Regular vines with strongly chordal pattern of (conditional) independence ⋮ Unnamed Item ⋮ Maxclique and unit disk characterizations of strongly chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs whose neighborhoods have no special cycles
- Characterizations of strongly chordal graphs
- A characterization of totally balanced hypergraphs
- Distance-hereditary graphs
- Complement reducible graphs
- Representing triangulated graphs in stars
- Counting clique trees and computing perfect elimination schemes in parallel
- Homogeneously orderable graphs
- Induced cycle structure and outerplanarity
- Determinantal formulae for matrix completions associated with chordal graphs
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
- A characterisation of rigid circuit graphs
- Incidence graphs of biacyclic hypergraphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representations of chordal graphs as subtrees of a tree
- Power of Natural Semijoins
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Perfect Elimination and Chordal Bipartite Graphs
- Dually Chordal Graphs
- The leafage of a chordal graph
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Strong clique trees, neighborhood trees, and strongly chordal graphs
This page was built for publication: Subgraph trees in graph theory
