holyers_conjecture (189B)
1 # Holyer's conjecture 2 3 Proved in [dor1997graph]: [graph_partition_edges] is [NP_hard] whenever the fixed graph is [graph_connected] and has three edges or more 4 5 Up: [graph_partition_edges]
wiki_researchpersonal research wiki | |
| git clone https://a3nm.net/git/wiki_research/ | |
| Log | Files | Refs |