Circular Coloring the Plane

DOI10.1137/060664276MaRDI QIDQ3503228zbMATH OpenOpenAlexFDO

Authors Matt DeVos, J. B. Ebrahimi, Bojan Mohar, Reza Naserasr, M. Ghebleh, Luis Goddyn

Publication date 22 May 2008

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/38f593d54e9767044d1fdda92f25e26a73ab92b8

zbMATH Keywords

circular coloringgraph coloringunit distance graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• First non-trivial upper bound on circular chromatic number of the plane
• Upper bound on the circular chromatic number of the plane
• scientific article; zbMATH DE number 653246
• All unit-distance graphs of order 6197 are 6-colorable
• -unit distance graphs

Cited in

(9)

• A cycle-space invariant of the \(<2\)-distance-graph in the plane
• Upper bound on the circular chromatic number of the plane
• -unit distance graphs
• Proof of a plane coloring theorem of Kruskal
• First non-trivial upper bound on circular chromatic number of the plane
• scientific article; zbMATH DE number 653246 (Why is no real title available?)
• scientific article; zbMATH DE number 866055 (Why is no real title available?)
• Recycling circle planes
• Coloring distance graphs on the plane

This page was built for publication: Circular Coloring the Plane

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