2-Graph Coloring (Graph Coloring)
Jump to navigation Jump to search
In this case, we wish to determine whether or not a graph is 2-colorable.
Generalizations: k-Graph Coloring
$n$: number of vertices
$m$: number of edges
Table of Algorithms
Currently no algorithms in our database for the given problem.