Generalized list colouring of graphs
Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park,, Jiayan Yan, and Xuding Zhu
TL;DR
This paper addresses advanced graph coloring problems by disproving a conjecture and answering a question, thereby advancing understanding in the field of list coloring of graphs.
Contribution
It provides a counterexample to a conjecture and resolves a question, introducing new open problems in generalized list coloring.
Findings
Disproves Wang, Wu, Yan, and Xie's conjecture
Answers negatively to Dvorak, Pekarek, and Sereni's question
Poses five new open problems in the field
Abstract
This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems.
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
TopicsGraph Labeling and Dimension Problems · Teaching and Learning Programming · Information Systems Education and Curriculum Development