An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles

DOI10.2307/2689591zbMath0546.05036OpenAlexW4234893958MaRDI QIDQ3337497

D. G. Johnston, Les R. Foulds

Publication date: 1984

Full work available at URL: https://doi.org/10.2307/2689591

zbMATH Keywords

maximal cliques0-1 integer programmingChessboard non-attacking puzzles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items (2)

Linear congruence equations for the solutions of the \(N\)-queens problem ⋮ A survey of known results and research areas for \(n\)-queens

This page was built for publication: An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles