VPG and EPG bend-numbers of Halin graphs
From MaRDI portal
Publication:323044
DOI10.1016/j.dam.2016.07.007zbMath1346.05135arXiv1505.06036OpenAlexW2237852414MaRDI QIDQ323044
Mathew C. Francis, Abhiruk Lahiri
Publication date: 7 October 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.06036
Related Items (13)
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid ⋮ CPG graphs: some structural and hardness results ⋮ Drawing Halin-graphs with small height ⋮ Hardness and approximation for L-EPG and \(B_1\)-EPG graphs ⋮ Proper circular arc graphs as intersection graphs of paths on a grid ⋮ Characterising circular-arc contact \(B_0\)-VPG graphs ⋮ \(B_0\)-VPG representation of AT-free outerplanar graphs ⋮ Edge-intersection graphs of boundary-generated paths in a grid ⋮ On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid ⋮ Listing all spanning trees in Halin graphs — sequential and Parallel view ⋮ Order-Preserving 1-String Representations of Planar Graphs ⋮ EPG-representations with Small Grid-Size ⋮ On contact graphs of paths on a grid
Cites Work
- On the bend-number of planar and outerplanar graphs
- Edge-intersection graphs of grid paths: the bend-number
- String graphs of k-bend paths on a grid
- Equilateral L-Contact Graphs
- Edge intersection graphs of single bend paths on a grid
- Vertex Intersection Graphs of Paths on a Grid
- Vertex Contact Representations of Paths on a Grid
- 1-String B_2-VPG Representation of Planar Graphs
- Unnamed Item
This page was built for publication: VPG and EPG bend-numbers of Halin graphs
