On the representation of triangulation graphs in trees

DOI10.1016/S0195-6698(84)80014-1zbMath0541.05049MaRDI QIDQ794674

Rudolf Halin

Publication date: 1984

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

intersection graphsimplicial decompositionstree-representable graphs

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75)

Related Items

Strongly perfect infinite graphs ⋮ Simplicial tree-decompositions of infinite graphs. I ⋮ Tree-decompositions, tree-representability and chordal graphs ⋮ Mutually embeddable graphs and the tree alternative conjecture ⋮ Simplicial decompositions of graphs: A survey of applications ⋮ A separation property of planar triangulations ⋮ Clique trees of infinite locally finite chordal graphs ⋮ Simplicial minors and decompositions of graphs

Cites Work

• On rigid circuit graphs
• A characterisation of rigid circuit graphs
• Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
• Über unendliche Wege in Graphen
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representations of chordal graphs as subtrees of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item