arXiv (All)
open access
Perfect Rectangular Tilings with Two Colors
We study a finite tiling problem, where tiles are unit squares whose four edges are colored with one of two colors. We ask whether a given rectangle admits a perfect rectangular tiling: every cell of the rectangle is occupied by one tile, neighboring edge colors match, and exactly $n_i$ tiles of typ
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Four Color Theorem meets Shapes of Polyhedra#1118521
- A 21-Coloring of the Plane Without Monochromatic Unit-Area Rectangles#820016
- The game chromatic number of generalized Mycielski graphs of paths and cycles#924181
- The game chromatic number of generalized Mycielski graphs of paths and cycles#919950
- Maximum Matching-Match: Hardness and Approximation#975248
Record · ID 1061927
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive