Packing an equilateral polygon in a thin strip

DOI10.1007/BF01265298MaRDI QIDQ1900002zbMATH OpenFDO

Authors Kiran B. Chilakamarri, Manley Perkel, Gerd H. Fricke

Publication date 30 May 1996

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01265298

zbMATH Keywords

chromatic numberdistance graphsequilateral polygonpackingstripthin stripwidth

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Coloring of graphs and hypergraphs (05C15) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• The chromatic number of the plane: the bounded case
• The chromatic number of the Minkowski plane -- the regular polygon case
• On the chromatic number of plane tilings
• The plane-width of graphs
• Tearing a strip off the plane

Cites work

• Euclidean Ramsey theorems. I
• scientific article; zbMATH DE number 51916 (Why is no real title available?)
• scientific article; zbMATH DE number 653246 (Why is no real title available?)

This page was built for publication: Packing an equilateral polygon in a thin strip

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