arXiv (All)
open access
Every cubic graph has four total dominating sets covering each vertex at most twice
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 $3$-uniform $3$-regular hypergraphs. We prove the conjecture, which also answers the question in the affirmative.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Simplicial arrangements in real projective three-space revisited#785003
- Simplicial arrangements in real projective three-space revisited#783413
- Partitioning an $S$-packing coloring into broadcast dominating sets#1188155
- Reconstruction of Finite Posets of Width Three#1296697
- Around higher-order Godbersen conjectures#1014816
Record · ID 1345273
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive