Graph TheoryHardGraph Coloring
Graph Coloring · Hard problem
Let be the -cycle on vertices with edges . Let be the COMPLEMENT of : two vertices are adjacent in exactly when they are NOT adjacent in (and are not the same vertex). What is ?
Let be the -cycle on vertices with edges . Let be the COMPLEMENT of : two vertices are adjacent in exactly when they are NOT adjacent in (and are not the same vertex). What is ?