bibin/cphb
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

References

Browse source
This commit is contained in:
Antti H S Laaksonen 2017-02-21 01:17:36 +02:00
parent 797035fd8a
commit 07816edf67
16 changed files with 237 additions and 40 deletions
Download patch file Download diff file Expand all files Collapse all files

2
luku12.tex
View file

@ -546,4 +546,4 @@ it is difficult to find out if the nodes
in a graph can be colored using $k$ colors
so that no adjacent nodes have the same color.
Even when $k=3$, no efficient algorithm is known
but the problem is NP-hard.
but the problem is NP-hard \cite{gar79}.