Twin-width of Planar Graphs; a Short Proof

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F25%3A00140849" target="_blank" >RIV/00216224:14330/25:00140849 - isvavai.cz</a>
Result on the web
<a href="http://arxiv.org/abs/2302.08938" target="_blank" >http://arxiv.org/abs/2302.08938</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2024.104036" target="_blank" >10.1016/j.ejc.2024.104036</a>

Result language
angličtina
Original language name
Twin-width of Planar Graphs; a Short Proof
Original language description
The fascinating question of the maximum value of twin-width on planar graphs is nowadays not far from the final resolution; there is a lower bound of 7 coming from a construction by Král’ and Lamaison (2022), and an upper bound of 8 by Hliněný and Jedelský (2022). The upper bound (currently best) of 8, however, is rather complicated and involved. In the paper we give a short and simple self-contained proof that the twin-width of planar graphs is at most 11. We believe that this short proof can also shed more light on the topic of upper bound(s) on the twin-width of planar and beyond-planar graphs in general.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)