Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

Read full text Summarise with VIRAT
Authors: Zdeněk Dvořák, Félix Moreno Peñarrubia
Cited by: 0
References: 11

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

ABSTRACT 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.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems Limits and Structures in Graph Theory

Publication details

Journal / source
Journal of Graph Theory
Volume
112
Issue
3
Pages
267–275
Publication date
25 March 2026
Language
EN