Towards Characterization of Five‐List‐Colorability of Toroidal Graphs
Journal of Graph Theory · 2026-07 · 112 (3) · 267-275
DOI: 10.1002/jgt.70031 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 25.03.2026. Verfasst von Zdeněk Dvořák und 1 weiteren Autor:innen. Die Arbeit nennt 11 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Auckland University of Technology, New Zealand.
Abstract (Originalsprache)
Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four. This condition is satisfied by all previously known obstructions, and we verify that there are no additional obstructions with this property. This supports the conjecture that a toroidal graph is 5‐choosable if and only if it is 5‐colorable.
Förderung
- Auckland University of Technology, New Zealand
Zitieren
APA
Dvořák, Z., & Peñarrubia, F. M. (2026). Towards Characterization of Five‐List‐Colorability of Toroidal Graphs. Journal of Graph Theory, 112(3), 267-275. https://doi.org/10.1002/jgt.70031
Vancouver
Dvořák Z, Peñarrubia FM. Towards Characterization of Five‐List‐Colorability of Toroidal Graphs. Journal of Graph Theory. 2026;112(3):267-275. doi:10.1002/jgt.70031
BibTeX
@article{Dvok2026,
author = {Dvořák, Zdeněk and Peñarrubia, Félix Moreno},
title = {Towards Characterization of Five‐List‐Colorability of Toroidal Graphs},
journal = {Journal of Graph Theory},
year = {2026},
volume = {112},
number = {3},
pages = {267--275},
doi = {10.1002/jgt.70031}
}
EUVIMED