Open Library
metadata only
Fundamentals of domination in graphs
Open Library Work: Fundamentals of domination in graphs
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
- An improved lower and upper bound of the k-limited domination number#1156714
- Domination Parameters of Graph Covers#1037704
- Locating-dominating partitions for some classes of graphs#147107
- On $1$-limited and $(1,2)$-domination in cubic graphs#1157067
- On Hypergraph Supports#1013362
Record · ID 1179875
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