Chromatic Number: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of vertices | $n$: number of vertices | ||
m: number of edges | $m$: number of edges | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Currently no algorithms in our database for the given problem. | |||
== References/Citation == | == References/Citation == | ||
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=4031392 | https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=4031392 | ||
Latest revision as of 07:53, 10 April 2023
Description
In this case, we wish to compute the chromatic number of a graph; that is, the smallest number of colors needed to color the graph.
Related Problems
Related: k-Graph Coloring, 2-Graph Coloring, 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
Table of Algorithms
Currently no algorithms in our database for the given problem.
References/Citation
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=4031392