Covering Regions with Squares

DOI10.1137/0602026zbMath0498.05054OpenAlexW2055487687MaRDI QIDQ3963050

Michael O. Albertson, Claire J. O'Keefe

Publication date: 1981

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

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

zbMATH Keywords

independence numberchromatic numberperfect graphsclique covering numberconnected board

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Covering orthogonal polygons with star polygons: The perfect graph approach

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of perfect graphs
• It’s Hard to Color Antirectangles
• Covering Regions by Rectangles

This page was built for publication: Covering Regions with Squares