arXiv (All)
open access
A 50-Vertex Cubic Counterexample to the Domination-versus-Edge-Domination Conjecture
Baste, Furst, Henning, Mohr, and Rautenbach conjectured that every finite regular graph of positive degree satisfies \(γ(G) \leq γ_e(G)\), where \(γ\) is the domination number and \(γ_e\) is the edge domination number, equivalently the minimum cardinality of a maximal matching. We show that the conj
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
- A Counterexample to an Eternal Domination Conjecture#999026
- Rainbow Dominating Sets of Graphs#200313
- On domination: toward a status-centric view#98890
- Towards a theory of domination#490164
- Employment without Domination#76653
Record · ID 997773
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