Tree-decompositions, tree-representability and chordal graphs

DOI10.1016/0012-365X(88)90071-4zbMath0648.05047OpenAlexW2089300286MaRDI QIDQ1104938

Reinhard Diestel

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90071-4

zbMATH Keywords

intersection graphtree-decompositionchordalsimplicial minor

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items

Simplicial decompositions of graphs: A survey of applications ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Decomposing infinite graphs

Cites Work

• Unnamed Item
• On the representation of triangulation graphs in trees
• A characterisation of rigid circuit graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Simplicial minors and decompositions of graphs