Planar Graphs as VPG-Graphs
From MaRDI portal
Publication:2842201
DOI10.7155/jgaa.00300zbMath1295.05083OpenAlexW2006509742MaRDI QIDQ2842201
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (9)
Intersection graphs of L-shapes and segments in the plane ⋮ CPG graphs: some structural and hardness results ⋮ Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs ⋮ Vertex Contact Graphs of Paths on a Grid ⋮ Good spanning trees in graph drawing ⋮ Order-Preserving 1-String Representations of Planar Graphs ⋮ The interval number of a planar graph is at most three ⋮ On the bend-number of planar and outerplanar graphs ⋮ On some special classes of contact \(B_0\)-VPG graphs
This page was built for publication: Planar Graphs as VPG-Graphs
