arXiv (All)
open access
Boundedness and Separation Between Induced and Non-Induced Covering Numbers
There are four covering numbers $\mathrm{c}_g^{\mathcal{G}}(H),\mathrm{c}_u^{\mathcal{G}}(H),\mathrm{c}_l^{\mathcal{G}}(H),\mathrm{c}_f^{\mathcal{G}}(H)$, each of which measures in a slightly different way how well the edges of a graph $H$ (called a host) can be covered with graphs of a class $\math
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
- Domination Parameters of Graph Covers#1037704
- Locating-dominating partitions for some classes of graphs#147107
- Settling the total domination-annihilation conjecture for graphs with minimum degree two#1069947
- Fair Secure Roman Dominating Function in Graphs#730349
- Disproof of the dominating Hadwiger conjecture#1129953
Record · ID 996688
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