A characterization of intersection graphs of the maximal rectangles of a polyomino
From MaRDI portal
Publication:687125
DOI10.1016/0012-365X(93)90578-HzbMath0793.05049MaRDI QIDQ687125
Publication date: 1 November 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Polyominoes (05B50)
Related Items (3)
Slightly triangulated graphs are perfect ⋮ Intersection graphs of maximal sub-polygons of \(k\)-lizards ⋮ Polyominos and perfect graphs
Cites Work
This page was built for publication: A characterization of intersection graphs of the maximal rectangles of a polyomino
