4-connected planar graphs are in $B_3$-EPG
Therese Biedl, Claire Pennarun

TL;DR
This paper proves that all 4-connected planar graphs can be represented as $B_3$-EPG graphs, where each vertex is a curve with at most three bends sharing grid edges for adjacency.
Contribution
It introduces a new representation for 4-connected planar graphs as $B_3$-EPG graphs, extending previous models with a modified touching of thickened L-shapes.
Findings
All 4-connected planar graphs have a $B_3$-EPG representation.
The construction modifies existing L-shape representations.
The approach ensures adjacency corresponds to shared grid edges.
Abstract
We show that every 4-connected planar graph has a -EPG representation, i.e., every vertex is represented by a curve on the grid with at most three bends, and two vertices are adjacent if and only if the corresponding curves share an edge of the grid. Our construction is based on a modification of the representation by touching thickened -shapes proposed by Gon\c{c}alves et al.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Digital Image Processing Techniques · Advanced Numerical Analysis Techniques
