A Class of Perfect Graphs Associated with Planar Rectilinear Regions

DOI10.1137/0603034zbMath0506.05050OpenAlexW2010552087MaRDI QIDQ4742824

Michael E. 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

perfect graphunit squarescovering problemrectilinear regionsmaximum antirectangleminimum rectangle cover

Mathematics Subject Classification ID

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

Related Items (1)

Covering orthogonal polygons with star polygons: The perfect graph approach

Cites Work

• Covering Regions by Rectangles
• Unnamed Item
• Unnamed Item

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