scientific article; zbMATH DE number 4063108

MaRDI QIDQ3797190zbMATH OpenFDO

Authors Eleanor O'M. Hare, Stephen T. Hedetniemi

Publication date 1987

zbMATH Keywords

algorithmchessboardminimum number of knights

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Designs and configurations (05B99)

Recommendations

• Publication:4865134
• Optimal algorithms for constructing knight's tours on arbitrary n m chessboards
• scientific article; zbMATH DE number 4039319
• scientific article; zbMATH DE number 2197897
• Computational methods and new results for chessboard problems
• Linear time algorithm for dominator chromatic number of trestled graphs
• A maximum flow algorithm to locate non-attacking queens of an n n chessboard
• Efficient domination in knights graphs
• The kth border-bishop domination problem
• A bit computing algorithm for the N-queens problem

Cited in

(7)

• Optimal algorithms for constructing knight's tours on arbitrary n m chessboards
• Domination in chessboards
• An improved method for finding knight covers.
• scientific article; zbMATH DE number 2197890 (Why is no real title available?)
• scientific article; zbMATH DE number 2197897 (Why is no real title available?)
• scientific article; zbMATH DE number 2230319 (Why is no real title available?)
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3797190)