Coloring#
Greedy coloring strategies available for graph_greedy_color |
|
Color a |
|
|
Color edges of a graph by checking whether the graph is bipartite, and if so, calling the algorithm for edge-coloring bipartite graphs. |
Color edges of a |
|
|
Color edges of a |
|
Compute a two-coloring of a directed graph |