arXiv Analytics

Sign in

arXiv:math/0408363 [math.CO]AbstractReferencesReviewsResources

Three Colorability of an Arrangement Graph of Great Circles

I. Cahit

Published 2004-08-26Version 1

Stan Wagon asked the following in 2000. Is every zonohedron face 3-colorable when viewed as a planar map? An equivalent question, under a different guise, is the following: is the arrangement graph of great circles on the sphere always vertex 3-colorable? (The arrangement graph has a vertex for each intersection point, and an edge for each arc directly connecting two intersection points.) Assume that no three circles meet at a point, so that this arrangement graph is 4-regular. In this note we have shown that all arrangement graphs defined as above are 3-colorable.

Comments: 6 pages, 4 figures
Categories: math.CO
Subjects: 05C15
Related articles: Most relevant | Search more
arXiv:1912.03724 [math.CO] (Published 2019-12-08)
On $4$-chromatic Schrijver graphs: their structure, non-$3$-colorability, and critical edges
arXiv:1204.4018 [math.CO] (Published 2012-04-18)
Fault Diagnosability of Arrangement Graphs
arXiv:2501.07129 [math.CO] (Published 2025-01-13)
$(2,4)$-Colorability of Planar Graphs Excluding $3$-, $4$-, and $6$-Cycles