Colouring stability two unit disk graphs
Henning Bruhn
TL;DR
This paper proves a bound on the chromatic number relative to the clique number for stability two unit disk graphs, advancing understanding of their coloring properties.
Contribution
It establishes a new upper bound on the chromatic number for a specific class of geometric graphs, namely stability two unit disk graphs.
Findings
Chromatic number at most 1.5 times the clique number for stability two unit disk graphs
Provides theoretical bounds for coloring such graphs
Advances geometric graph coloring theory
Abstract
We prove that every stability two unit disk graph has chromatic number at most 3/2 times its clique number.
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 · Limits and Structures in Graph Theory