n is the number of vertex and Bruteforce is O(3^n)..Thanks in advance.
(it's a additional exercise of SRM487D1_550pt)
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
Name |
---|
Second attempt:
Is it correct, that if graph is not 3-colorable, it necessarily have such 4 vertexes, that have all 6 edges between them?
If true, than we could check C(n,4) combinations of vertexes of the graph and for all of them check this property. It would give O(n^4) but I think I am missing something important.