arXiv (All)
open access
The Truncated Octahedral Graph Has Bondage Number Five
For a graph G, its bondage number b(G) is the minimum number of edges whose deletion increases its domination number. Dunbar, Haynes, Teschner, and Volkmann conjectured in 1998 that every nontrivial planar graph satisfies b(G) <= Delta(G) + 1. We show that the truncated octahedral graph T has gamma(
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
- The Truncated Octahedral Graph Has Bondage Number Five#920125
- Optimally pseudorandom $K_4$-free graphs#1116792
- Graph Theory: Fundamental and Applications in Mathematics#119203
- Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space#1013339
- Refuting the QAOA fixed-angle conjecture#1064247
Record · ID 924356
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