7 Colourings
compalg.inf.elte.hu
Author: openj-gate.com ~ Tags: compalg.inf.elte.hu ~ Date: 2022/08/04
We note that there is no easy characterisation of graphs with chromatic number greater or equal to three The graph vertex colouring problem is a standard NP - Information from compalg.inf.elte.hu
Information accuracy 100%
Read more from compalg.inf.elte.hu information was found here: http://compalg.inf.elte.hu/~tony/Oktatas/TDK/FINAL/Chap%207.PDF