A Class of Perfect Graphs Associated with Planar Rectilinear Regions

DOI10.1137/0603034MaRDI QIDQ4742824zbMATH OpenOpenAlexFDO

Authors Michael Saks

Publication date 1982

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

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

zbMATH Keywords

covering problemmaximum antirectangleminimum rectangle coverperfect graphrectilinear regionsunit squares

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites work

• Covering Regions by Rectangles
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3485819 (Why is no real title available?)

Cited in

(1)

• Covering orthogonal polygons with star polygons: The perfect graph approach

This page was built for publication: A Class of Perfect Graphs Associated with Planar Rectilinear Regions

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