Graph Colouring
How many unique colors will be required for proper vertex coloring of a complete graph having n vertices?
Minimum number of colors required for proper edge coloring of a graph is called?
The minimum number of colours required to properly vertex-colour a complete graph (K_n) with n vertices is:
A bipartite graph can always be properly vertex-coloured with
Which of the following algorithms can be used to find a valid vertex colouring of a graph (it might not be the minimum number of colours)?
What is the chromatic number of a cycle graph with n vertices where n is odd?
What is Vizing's theorem about edge coloring?
What is the Hadwiger conjecture in graph coloring?
What is the relationship between perfect graphs and graph coloring?