Intersection graphs of orthodox paths in trees
From MaRDI portal
(Redirected from Publication:2413157)
Recommendations
Cites work
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- A recognition algorithm for the intersection graphs of paths in trees
- Connectivity threshold for random chordal graphs
- Constant tolerance intersection graphs of subtrees of a tree
- Constant tolerance representations of graphs in trees
- Edge and vertex intersection of paths in a tree
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- Recognizing vertex intersection graphs of paths on bounded degree trees
- The edge intersection graphs of paths in a tree
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Tolerance intersection graphs on binary trees with constant tolerance 3
- Topics in Intersection Graph Theory
- Treewidth of graphs with balanced separations
Cited in
(5)
This page was built for publication: Intersection graphs of orthodox paths in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413157)