# k-Graph Coloring (Graph Coloring)

Jump to navigation
Jump to search

## 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

Currently no algorithms in our database for the given problem.

## References/Citation

https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4031392