A Class of Perfect Graphs

DOI10.1137/0603027zbMath0506.05049OpenAlexW1981845048MaRDI QIDQ4742823

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

perfect graphmaximal rectanglessimply connected polyomino

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) Polyominoes (05B50)

Related Items (6)

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

Cites Work

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

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