Pathlength of outerplanar graphs
From MaRDI portal
Publication:6109003
DOI10.1007/978-3-031-20624-5_11MaRDI QIDQ6109003
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (1)
Cites Work
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Line-distortion, bandwidth and path-length of a graph
- Dynamic analysis of the arrow distributed protocol
- Min Cut is NP-complete for edge weighted trees
- On the complexity of computing treebreadth
- Tree-decompositions with bags of small diameter
- Minimum Eccentricity Shortest Paths in some Structured Graph Classes
- Monadic second-order definable graph orderings
- Approximation of pathwidth of outerplanar graphs
- Pathwidth of outerplanar graphs
- Dividing a Graph into Triconnected Components
- Metric Dimension of Bounded Tree-length Graphs
- Pathlength of outerplanar graphs
This page was built for publication: Pathlength of outerplanar graphs
