Back to Results
First PageMeta Content
Spanning tree / NP-complete problems / One-in-three 3SAT / Tree / Theoretical computer science / Mathematics / Computational complexity theory


1 EGRES Quick-Proof No[removed]Finding edge-disjoint subgraphs in graphs Attila Bern´ath? and Zolt´an Kir´aly
Add to Reading List

Document Date: 2010-04-12 06:05:14


Open Document

File Size: 183,46 KB

Share Result on Facebook
UPDATE