
TL;DR
This paper investigates partial list coloring in graphs, proving a conjecture for at least half of the list sizes and proposing a new related conjecture with supporting results.
Contribution
The paper confirms a conjecture for many list sizes and introduces a new related conjecture in the field of partial list coloring.
Findings
Conjecture holds for at least half of the list sizes
New partial list coloring results support the conjecture
Proposes and explores a new related conjecture
Abstract
Let be a simple graph with vertices and list chromatic number . Suppose that and each vertex of is assigned a list of colors. Albertson, Grossman and Haas [1] conjectured that at least vertices of can be colored from these lists. In this paper we find some new results in partial list coloring which help us to show that the conjecture is true for at least half of the numbers of the set . In addition we introduce a new related conjecture and finally we present some results about this conjecture.
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
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
