It’s Hard to Color Antirectangles

DOI10.1137/0605018zbMATH Open0542.05027OpenAlexW1971442572MaRDI QIDQ3329490FDOQ3329490

Authors: Andy Boucher 

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605018

Recommendations

• A minimax theorem on intervals
• scientific article; zbMATH DE number 1054780
• Covering simply connected regions by rectangles
• scientific article; zbMATH DE number 736298
• Tiling the unit square with squares and rectangles
• Partitioning a rectangle into small perimeter rectangles
• scientific article; zbMATH DE number 5778170
• On Covering Problems of Rado
• Tiling Squares with Big Holes with L-trominoes
• On covering problems of Rado

zbMATH Keywords

rectangleconvex boardslattice squaresmaximal sized antirectangle

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cites Work

• Covering Regions by Rectangles

Cited In (3)

• A minimax theorem on intervals
• Covering Regions with Squares
• Covering orthogonal polygons with star polygons: The perfect graph approach

This page was built for publication: It’s Hard to Color Antirectangles

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