Graph TheoryChallengeGraph Coloring
Graph Coloring · Challenge problem
A "theta" graph has two hub vertices joined by three internally-disjoint paths of lengths , , and edges (so the paths have internal vertices respectively, vertices in all). What is its chromatic number?