Multiple list colouring triangle-free planar graphs
Yiting Jiang, Xuding Zhu

TL;DR
This paper demonstrates that for every positive integer m, there exist triangle-free planar graphs that cannot be properly list-colored under certain parameters, highlighting limitations in list coloring.
Contribution
It introduces specific counterexamples showing the non-choosability of triangle-free planar graphs for particular list coloring parameters.
Findings
Existence of triangle-free planar graphs not (3m+⌈m/17⌉-1, m)-choosable for each m
Counterexamples challenge previous assumptions on list coloring bounds
Highlights limitations in list coloring of planar graphs
Abstract
This paper proves that for each positive integer , there is a triangle-free planar graph which is not -choosable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research
