On the public citation graph

Values of Domination Numbers of the Queen's Graph

https://doi.org/10.37236/1573
0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4899-3585-4openalex-snapshot
Unsolved Problems in Number Theory
inferredcites →https://doi.org/10.1007/bf01692200openalex-snapshot
Mathematische Unterhaltungen und Spiele
inferredcites →https://doi.org/10.1007/bf01742866openalex-snapshot
Mathematische Unterhaltungen und Spiele
inferredcites →https://doi.org/10.1016/0012-365x(90)90344-hopenalex-snapshot
Chessboard domination problems
inferredcites →https://doi.org/10.1016/0012-365x(95)00327-sopenalex-snapshot
Domination and irredundance in the queens' graph
inferredcites →https://doi.org/10.1016/0020-0190(79)90016-4openalex-snapshot
A technique for implementing backtrack algorithms and its application
inferredcites →https://doi.org/10.1016/s0012-365x(00)00467-2openalex-snapshot
Upper bounds for domination numbers of the queen's graph
inferredcites →https://doi.org/10.1016/s0166-218x(01)00244-xopenalex-snapshot
An upper bound for the minimum number of queens covering the n×n chessboard
inferredcites →https://doi.org/10.1016/s0167-5060(08)71033-1openalex-snapshot
Chessboard Domination Problems
inferredcites →https://doi.org/10.1016/s0167-5060(08)71034-3openalex-snapshot
On the Queen Domination Problem
inferredcites →https://doi.org/10.1201/9781315141428-6openalex-snapshot
Combinatorial Problems on Chessboards: II
inferredcites →https://doi.org/10.48550/arxiv.cs/0011047openalex-snapshot
Dancing links

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11493853_8openalex-snapshot
Filtering Algorithms for the NValue Constraint
inferred← citeshttps://doi.org/10.1007/978-0-387-26677-0_4openalex-snapshot
Additive Number Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-31110-0_1openalex-snapshot
Pioneer of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-58892-2_12openalex-snapshot
Domination in Chessboards
inferred← citeshttps://doi.org/10.1007/978-3-030-58892-2_6openalex-snapshot
Irredundance
inferred← citeshttps://doi.org/10.1007/978-3-031-65064-2_1openalex-snapshot
Chessboard Domination: Introduction of Some New Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_8openalex-snapshot
My Top 10 Graph Theory Conjectures and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_5openalex-snapshot
Queens Around the World in Twenty-Five Years
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_12openalex-snapshot
Decomposition of the NValue Constraint
inferred← citeshttps://doi.org/10.1007/s10601-006-9001-9openalex-snapshot
Filtering Algorithms for the NValue Constraint
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101913openalex-snapshot
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem
inferred← citeshttps://doi.org/10.1016/j.dam.2009.09.019openalex-snapshot
minimum dominating set of queens: A trivial programming exercise?
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.065openalex-snapshot
Queen's domination using border squares and (A,B) -restricted domination
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.031openalex-snapshot
Independent domination in graphs: A survey and recent results
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00802-6openalex-snapshot
An improved upper bound for queens domination numbers
inferred← citeshttps://doi.org/10.1145/1185448.1185463openalex-snapshot
Chessboard domination on programmable graphics hardware
inferred← citeshttps://doi.org/10.37236/10617openalex-snapshot
Queen Domination of Even Square Boards
inferred← citeshttps://doi.org/10.37236/6026openalex-snapshot
Domination of the Rectangular Queen's Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1608.02531openalex-snapshot
Tight lower bounds for connected queen domination problems on the chessboard
inferred← citeshttps://doi.org/10.7151/dmgt.1193openalex-snapshot
Upper bounds for the domination numbers of toroidal queens graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.