Semialgebraic Graphs having Countable List-Chromatic Numbers
James H. Schmerl
TL;DR
This paper characterizes semialgebraic graphs with countable list-chromatic numbers and explores related classes, advancing understanding of graph coloring in algebraic and geometric contexts.
Contribution
It provides a complete characterization of semialgebraic graphs with countable list-chromatic numbers, including related graph classes.
Findings
Characterization of semialgebraic graphs with countable list-chromatic numbers
Identification of related graph classes with similar properties
Advancement in understanding algebraic graph coloring
Abstract
The set of semialgebraic graphs having countable list-chromatic numbers is characterized. Some other related sets of graphs having countable list-chromatic numbers also are.
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
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Advanced Algebra and Logic