Graph TheoryMediumGraph Coloring
Graph Coloring · Medium problem
Take (five mutually linked vertices) and remove just ONE edge, say the one between vertices and ( links remain, out of the in ). Unlike itself, this graph IS planar (it satisfies the planar edge bound exactly, with ). What is its chromatic number?