arXiv (All)
open access
An Independent Border-Free Type-A Cover of Q221 and Improved Asymptotic Bounds for Queen Domination
The queen's graph $Q_n$ has the squares of the $n\times n$ chessboard as vertices, with adjacency defined by a common row, column, or diagonal. We give an explicit set of 111 pairwise nonattacking queens on $Q_{221}$. The set contains no queen on an outer row or column and satisfies the original typ
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
- On $k$-limited domination: complexity and Cartesian products#1156397
- Order and Gorenstein properties for lattice path matroid polytopes#820127
- Vizing's theorem for signed multigraphs#1117820
- ALMOST PERFECT MATRICES AND GRAPHS#941673
- On Counting Independent Sets in Regular Hypergraphs#1123829
Record · ID 821546
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