A Class of Perfect Graphs

DOI10.1137/0603027MaRDI QIDQ4742823zbMATH OpenOpenAlexFDO

Authors James B. Shearer

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/0603027

zbMATH Keywords

maximal rectanglesperfect graphsimply connected polyomino

Mathematics Subject Classification ID

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

Cites work

• Combinatorial designs related to the strong perfect graph conjecture
• Combinatorial properties of polyominoes

Cited in

(6)

• Polyominos and perfect graphs
• Perfect graphs and guarding rectilinear art galleries
• Intersection graphs of maximal sub-polygons of \(k\)-lizards
• A note on the contractions for orthogonal polygons
• A characterization of intersection graphs of the maximal rectangles of a polyomino
• Covering orthogonal polygons with star polygons: The perfect graph approach

This page was built for publication: A Class of Perfect Graphs

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