Intersection graphs of orthodox paths in trees
DOI10.1016/J.ENDM.2017.10.018zbMATH Open1383.05269OpenAlexW2765553335MaRDI QIDQ2413157FDOQ2413157
Authors: Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach 
Publication date: 9 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.018
Recommendations
line graphintersection graphchordal graph\((h,s,t)\)-representationorthodox \((h,s,t)\)-representation
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Topics in Intersection Graph Theory
- Edge and vertex intersection of paths in a tree
- Title not available (Why is that?)
- The edge intersection graphs of paths in a tree
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- A recognition algorithm for the intersection graphs of paths in trees
- Constant tolerance intersection graphs of subtrees of a tree
- Tolerance intersection graphs on binary trees with constant tolerance 3
- Recognizing vertex intersection graphs of paths on bounded degree trees
- Connectivity threshold for random chordal graphs
- Constant tolerance representations of graphs in trees
- 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)
