scientific article; zbMATH DE number 1124599

zbMath0888.05036MaRDI QIDQ4378627

Robert G. Reynolds, Sandra M. Hedetniemi, Stephen T. Hedetniemi

Publication date: 31 March 1998

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

zbMATH Keywords

independence numberdomination number\(N\)-queens problemchessboard graphirredundance number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (9)

An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard ⋮ Independence for knights on hexagon and triangle boards ⋮ Unnamed Item ⋮ Queen's domination using border squares and \((A,B)\)-restricted domination ⋮ A tour problem on a toroidal board ⋮ A survey of known results and research areas for \(n\)-queens ⋮ Irredundance ⋮ Domination in Chessboards ⋮ Game chromatic number of strong product graphs

This page was built for publication: