Planar graphs as VPG-graphs
From MaRDI portal
Publication:2842201
DOI10.7155/JGAA.00300zbMATH Open1295.05083OpenAlexW2006509742MaRDI QIDQ2842201FDOQ2842201
Authors: Steven Chaplick, Torsten Ueckerdt 
Publication date: 13 August 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00300
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (21)
- CPG graphs: some structural and hardness results
- Vertex contact graphs of paths on a grid
- String graphs of \(k\)-bend paths on a grid
- 1-string \(B_2\)-VPG representation of planar graphs
- Order-preserving 1-string representations of planar graphs
- The interval number of a planar graph is at most three
- Intersection graphs of L-shapes and segments in the plane
- Intersection graphs of L-shapes and segments in the plane
- Planar graphs as VPG-graphs
- Planar Digraphs
- Maximum independent set on \(B_1\)-VPG graphs
- VPG and EPG bend-numbers of Halin graphs
- On the bend-number of planar and outerplanar graphs
- B0-VPG Representation of AT-free Outerplanar Graphs
- On balanced +-contact representations
- On some special classes of contact \(B_0\)-VPG graphs
- Splitting \(B_2\)-VPG graphs into outer-string and co-comparability graphs
- \(B_0\)-VPG representation of AT-free outerplanar graphs
- Vertex contact representations of paths on a grid
- 1-string \(B_2\)-VPG representation of planar graphs
- Good spanning trees in graph drawing
This page was built for publication: Planar graphs as VPG-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842201)
