Reproduce “Proper Conflict-Free Coloring on Structured Graph Classes: Bounds, Exact Algorithms, and Hardness” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Kamal Santra
The authors study proper conflict-free coloring, where every non-isolated vertex has a uniquely colored neighbor, across several structured graph classes. They show interval graphs need at most ω(G)+1 colors, improving the prior χ(G)+2 bound, and lists of that size suffice. On well-partitioned chordal graphs, the answer is ω(G) or ω(G)+1, but deciding whether ω(G) suffices is NP-complete when the target varies.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.