The rook problem on saw-toothed chessboards

DOI10.1016/j.aml.2007.12.003zbMath1229.90153OpenAlexW2118960705MaRDI QIDQ847376

Hon-Chan Chen, Ting-Yem Ho

Publication date: 12 February 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2007.12.003

zbMATH Keywords

algorithmdominating setbipartite permutation graphchessboardrook problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Relation-algebraic modeling and solution of chessboard independence and domination problems ⋮ Alternating sign matrices, related (0,1)-matrices, and the Smith normal form ⋮ Domination in Chessboards

Cites Work

• Unnamed Item
• Edge domination on bipartite permutation graphs and cotriangulated graphs
• Acyclic domination on bipartite permutation graphs
• Bipartite permutation graphs
• Chessboard domination problems
• Chessboard graphs, related designs, and domination parameters
• Parallel concepts in graph theory
• An improved upper bound for queens domination numbers
• Upper bounds for domination numbers of the queen's graph

This page was built for publication: The rook problem on saw-toothed chessboards