On the representation of triangulation graphs in trees
From MaRDI portal
Publication:794674
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3743278 (Why is no real title available?)
- scientific article; zbMATH DE number 3332242 (Why is no real title available?)
- A characterisation of rigid circuit graphs
- On rigid circuit graphs
- Representations of chordal graphs as subtrees of a tree
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- Über unendliche Wege in Graphen
Cited in
(17)- Representing triangulated graphs in stars
- Mutually embeddable graphs and the tree alternative conjecture
- Simplicial minors and decompositions of graphs
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
- A separation property of planar triangulations
- Chordal Graphs as Intersection Graphs of Pseudosegments
- Graph of triangulations of a convex polygon and tree of triangulations
- scientific article; zbMATH DE number 3851152 (Why is no real title available?)
- Simplicial decompositions of graphs: A survey of applications
- Trees in triangulations
- Strongly perfect infinite graphs
- scientific article; zbMATH DE number 6873974 (Why is no real title available?)
- Simplicial tree-decompositions of infinite graphs. I
- Tree-decompositions, tree-representability and chordal graphs
- Tree representations of graphs
- A new approach to chordal graphs
- Clique trees of infinite locally finite chordal graphs
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)