Intersection graphs of non-crossing paths
From MaRDI portal
Publication:2301552
DOI10.1007/978-3-030-30786-8_24OpenAlexW2972576179MaRDI QIDQ2301552FDOQ2301552
Authors: Steven Chaplick 
Publication date: 24 February 2020
Full work available at URL: https://arxiv.org/abs/1907.00272
Recommendations
- Intersection graphs of non-crossing paths
- Graphs of edge-intersecting and non-splitting paths
- scientific article; zbMATH DE number 4174966
- Intersections of graphs
- The non-crossing graph
- scientific article; zbMATH DE number 3912430
- Intersection graphs of paths in a tree
- scientific article; zbMATH DE number 4116559
- Intersection graphs of orthodox paths in trees
- Intersection graphs of vertex disjoint paths in a tree
Cited In (4)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Routes enumeration in a Boolean with respect to intersection and nonintersection relations
- Intersection graphs of non-crossing paths
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
This page was built for publication: Intersection graphs of non-crossing paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301552)
