MathCastle
Graph TheoryChallengeGraph Coloring

Graph Coloring · Challenge problem

A "theta" graph has two hub vertices joined by three internally-disjoint paths of lengths 33, 33, and 55 edges (so the paths have 2,2,42,2,4 internal vertices respectively, 1010 vertices in all). What is its chromatic number?