Planar graphs as VPG-graphs
From MaRDI portal
Publication:2842201
Recommendations
Cited in
(20)- CPG graphs: some structural and hardness results
- 1-string \(B_2\)-VPG representation of planar graphs
- Intersection graphs of L-shapes and segments in the plane
- Planar Digraphs
- Vertex contact graphs of paths on a grid
- Splitting \(B_2\)-VPG graphs into outer-string and co-comparability graphs
- Intersection graphs of L-shapes and segments in the plane
- B0-VPG Representation of AT-free Outerplanar Graphs
- String graphs of \(k\)-bend paths on a grid
- \(B_0\)-VPG representation of AT-free outerplanar graphs
- Good spanning trees in graph drawing
- The interval number of a planar graph is at most three
- 1-string \(B_2\)-VPG representation of planar graphs
- Order-preserving 1-string representations of planar graphs
- On balanced +-contact representations
- Maximum independent set on \(B_1\)-VPG graphs
- VPG and EPG bend-numbers of Halin graphs
- Planar graphs as VPG-graphs
- On some special classes of contact \(B_0\)-VPG graphs
- Vertex contact representations of paths on a grid
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)