List-Edge-Coloring Triangulations with Maximum Degree at most 5
Joshua Harrelson, Jessica McDonald
TL;DR
This paper proves that all triangulations with maximum degree at most 5 satisfy the List-Edge-Coloring Conjecture, advancing understanding of edge-coloring in planar graphs.
Contribution
The paper establishes the List-Edge-Coloring Conjecture for triangulations with maximum degree at most 5, a significant step in graph coloring theory.
Findings
Triangulations with max degree ≤ 5 satisfy the List-Edge-Coloring Conjecture
Advances in edge-coloring of planar graphs
Supports conjecture in specific graph classes
Abstract
We prove that triangulations with maximum degree at most 5 satisfy the List-Edge-Coloring 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
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · graph theory and CDMA systems