Planar graph with twin-width seven
Daniel Kral, Ander Lamaison

TL;DR
This paper constructs a specific planar graph demonstrating that twin-width can reach as high as seven, providing insights into the complexity of planar graphs.
Contribution
The paper introduces a novel planar graph with twin-width exactly seven, advancing understanding of twin-width bounds in planar graphs.
Findings
Existence of a planar graph with twin-width seven
Twin-width can be as high as seven in planar graphs
Provides a new example for twin-width bounds
Abstract
We construct a planar graph with twin-width equal to seven.
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
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Structural Analysis and Optimization
