Polyominos and perfect graphs

DOI10.1016/0020-0190(94)00017-4zbMath0810.05020OpenAlexW1992204028MaRDI QIDQ1322110

Frédéric Maire

Publication date: 9 April 1995

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00017-4

zbMATH Keywords

colouringgeodesicperfect graphperfect graphsvisibility graphorthogonal polygonpolyominossegmentcollision graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Polyominoes (05B50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Art gallery problem with rook and queen vision ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms

Cites Work

• Unnamed Item
• A characterization of intersection graphs of the maximal rectangles of a polyomino
• Topics on perfect graphs
• Weakly triangulated graphs
• Covering orthogonal polygons with star polygons: The perfect graph approach
• Combinatorial properties of polyominoes
• Optimizing weakly triangulated graphs
• Perfect Graphs and Orthogonally Convex Covers
• A Class of Perfect Graphs

This page was built for publication: Polyominos and perfect graphs