K-Graph Coloring: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:k-Graph Coloring (Graph Coloring)}} == Description == Graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In this case, the number of colors we have is given as an input. == Related Problems == Subproblem: 2-Graph Coloring, 3-Graph Coloring, 4-Graph Coloring, 5-Graph Coloring, #k-Graph Coloring Related: Chromati...") |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of vertices | |||
m: number of edges | m: number of edges | ||
k: number of colors given to color the graph | |||
k: number of colors given to color the graph | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:03, 15 February 2023
Description
Graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In this case, the number of colors we have is given as an input.
Related Problems
Subproblem: 2-Graph Coloring, 3-Graph Coloring, 4-Graph Coloring, 5-Graph Coloring, #k-Graph Coloring
Related: Chromatic Number, 3-Graph Coloring, 4-Graph Coloring, 5-Graph Coloring, #k-Graph Coloring, #2-Graph Coloring, #3-Graph Coloring, #4-Graph Coloring, #5-Graph Coloring
Parameters
n: number of vertices
m: number of edges
k: number of colors given to color the graph
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Karger, Blum | 1997 | $O(poly(V))$ | $\tilde{O}(n^{3/14})$ | Deterministic | Time |
References/Citation
https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4031392