MathCastle
Graph TheoryMediumGraph Coloring

Graph Coloring · Medium problem

Two separate planar maps share no border at all: map PP is a ring of 55 regions (each bordering only its two ring neighbors), and map QQ is a ring of 44 regions (likewise). Treating all 99 regions together, what is the fewest colors needed so that no two bordering regions share a color?