On the rectangle eliminating number of grid graphs

DOI10.1016/J.TCS.2026.116199MaRDI QIDQ7363121zbMATH OpenFDO

Authors Enguo Niu, Zhongzheng Tang

Publication date 29 September 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116199

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Checker Boards and Polyominoes
• Constructive upper bounds on the rectangle eliminating number in grid graphs
• scientific article; zbMATH DE number 1161375 (Why is no real title available?)
• Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas \& depth-\(3\) transcendence degree-\(k\) circuits
• Reducibility among combinatorial problems
• The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment
• There is no 16-clue sudoku: solving the sudoku minimum number of clues problem via hitting set enumeration
• Tiling Deficient Boards with Trominoes
• Tiling Deficient Rectangles with Trominoes
• Tiling One-Deficient Rectangular Solids with Trominoes in Three and Higher Dimensions

This page was built for publication: On the rectangle eliminating number of grid graphs

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