Four proofs of the directed Brooks' Theorem
Pierre Aboulker, Guillaume Aubian
TL;DR
This paper presents four novel proofs of the directed Brooks' Theorem and establishes an NP-completeness result related to graph coloring.
Contribution
It introduces four new proofs of the directed Brooks' Theorem and proves an NP-completeness result, expanding theoretical understanding.
Findings
Four new proofs of the directed Brooks' Theorem
NP-completeness of a related graph coloring problem
Enhanced theoretical insights into directed graph coloring
Abstract
We give four new proofs of the directed version of Brook's Theorem and an NP-completeness result.
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 Algebra and Logic · Logic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms