A lowest order simple perfect 2 X 1 squared rectangle

DOI10.1016/0095-8956(79)90013-3MaRDI QIDQ1137048zbMATH OpenOpenAlexFDO

Authors A. J. W. Duijvestijn

Publication date 1979

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(79)90013-3

zbMATH Keywords

dissectiondomino-shapedplanar graphs

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of tessellation and tiling problems (05B45) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites work

• A procedure for dissecting a rectangle into squares, and an example for the rectangle whose sides are in the ratio 2:1
• Simple perfect squared square of lowest order
• Simple Perfect Squared Squares and 2 × 1 Squared Rectangles of Order 25
• Some simple perfect 2×1 rectangles

Cited in

(2)

• A method for cutting squares into distinct squares
• Simple perfect square-cylinders of low order

This page was built for publication: A lowest order simple perfect 2 X 1 squared rectangle

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