Informace o publikaci
Twin-width of Planar Graphs; a Short Proof
| Autoři | |
|---|---|
| Rok publikování | 2023 |
| Druh | Článek ve sborníku |
| Konference | European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23 |
| Fakulta / Pracoviště MU | |
| Citace | |
| Doi | http://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-082 |
| Klíčová slova | twin-width; planar graph |
| Popis | The fascinating question of the maximum value of twin-width on planar graphs is nowadays not far from a final resolution; there is a lower bound of coming from a construction by Král‘ and Lamaison [arXiv, September 2022], and an upper bound of by Hliněný and Jedelský [arXiv, October 2022]. The upper bound (currently best) of 7, however, is rather complicated and involved. We give a short and simple self-contained proof that the twin-width of planar graphs is at most 11. |