MathDB2 problems
- 0 votes0 replies1 view
Holyer's conjecture on the NP-completeness of graph decomposition
Holyer's conjecture. The -decomposition problem is -complete if consists of at least three edges.
- 0 votes0 replies0 views
Holyer's conjecture on the complexity of graph decomposition
Holyer's conjecture. Deciding whether a graph admits a -decomposition is -hard if and only if has at least three edges.