On the representation of triangulation graphs in trees
From MaRDI portal
Publication:794674
DOI10.1016/S0195-6698(84)80014-1zbMATH Open0541.05049MaRDI QIDQ794674FDOQ794674
Authors: Rudolf Halin 
Publication date: 1984
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- On rigid circuit graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representations of chordal graphs as subtrees of a tree
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- Title not available (Why is that?)
- Über unendliche Wege in Graphen
- A characterisation of rigid circuit graphs
- Title not available (Why is that?)
Cited In (17)
- Simplicial minors and decompositions of graphs
- Title not available (Why is that?)
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
- Tree-decompositions, tree-representability and chordal graphs
- Tree representations of graphs
- Representing triangulated graphs in stars
- Graph of triangulations of a convex polygon and tree of triangulations
- Clique trees of infinite locally finite chordal graphs
- Strongly perfect infinite graphs
- Title not available (Why is that?)
- A new approach to chordal graphs
- Mutually embeddable graphs and the tree alternative conjecture
- Trees in triangulations
- Simplicial decompositions of graphs: A survey of applications
- A separation property of planar triangulations
- Chordal Graphs as Intersection Graphs of Pseudosegments
- Simplicial tree-decompositions of infinite graphs. I
This page was built for publication: On the representation of triangulation graphs in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794674)
