Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{2306237, author = {Hliněný, Petr}, address = {Brno, Czech Republic}, booktitle = {European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23}, doi = {http://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-082}, keywords = {twin-width; planar graph}, howpublished = {elektronická verze "online"}, language = {eng}, location = {Brno, Czech Republic}, pages = {595-600}, publisher = {MUNI Press}, title = {Twin-width of Planar Graphs; a Short Proof}, year = {2023} }
TY - JOUR ID - 2306237 AU - Hliněný, Petr PY - 2023 TI - Twin-width of Planar Graphs; a Short Proof PB - MUNI Press CY - Brno, Czech Republic KW - twin-width KW - planar graph N2 - 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. ER -
HLINĚNÝ, Petr. Twin-width of Planar Graphs; a Short Proof. Online. In \textit{European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23}. Brno, Czech Republic: MUNI Press, 2023, s.~595-600. ISSN~2788-3116. Dostupné z: https://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-082.
|