Pages that link to "Item:Q927877"

The following pages link to The chromatic number of the plane: the bounded case (Q927877):

Displaying 13 items.

• A bound on the chromatic number of an almost planar graph (Q744556) (← links)
• An 18-colouring of 3-space omitting distance one (Q1363671) (← links)
• Axiom of choice and chromatic number of the plane (Q1406751) (← links)
• Upper bound on the circular chromatic number of the plane (Q1753019) (← links)
• Packing an equilateral polygon in a thin strip (Q1900002) (← links)
• Triangle colorings require at least seven colors (Q2032735) (← links)
• On the chromatic number of subsets of the Euclidean plane (Q2441349) (← links)
• A proof from The Book: a lower bound for the polychromatic number of the plane (Q2869398) (← links)
• Two-floor buildings need eight colors (Q2940593) (← links)
• Colorings of Circles (Q3325752) (← links)
• The chromatic number of the plane is at least 5 (Q4556186) (← links)
• On the chromatic number of plane tilings (Q4668459) (← links)
• Coloring distance graphs on the plane (Q6046170) (← links)