scientific article; zbMATH DE number 861434

zbMath0843.05061MaRDI QIDQ4871169

William D. Weakley, Harold W. Martin, Charles Wallis, Michael S. Jacobson, Alice A. McRae, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Gerd H. Fricke

Publication date: 21 May 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyindependencecombinatorial problemspacking problemdominationirredundanceopen problemsgrid graphchessboardcovering problemRooks graphBishops graphKings graphKnight graphnon-attacking queensnumber of queensQueens graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Other designs, configurations (05B30) Enumerative combinatorics (05A99) Combinatorial aspects of packing and covering (05B40)

Related Items (11)

An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard ⋮ Domination and irredundance in the queens' graph ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Irredundance in grids ⋮ Domination by queens on a square beehive ⋮ Binary programming formulations for the upper domination problem ⋮ A survey of known results and research areas for \(n\)-queens ⋮ Domination in Chessboards ⋮ Unnamed Item ⋮ Chessboard graphs, related designs, and domination parameters ⋮ My Top 10 Graph Theory Conjectures and Open Problems

This page was built for publication: