Indexed metadata
Every cubic graph has four total dominating sets covering each vertex at most twice
Hyemin Kwon, Boram Park, Yoshio Sano
Source abstract
In 2018, Goddard and Henning conjectured that every cubic graph has four total dominating sets covering each vertex at most twice, and asked the analogous question for transversals of -uniform -regular hypergraphs. We prove the conjecture, which also answers the question in the affirmative.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.