Back to Results
First PageMeta Content
Graph theory / Graph operations / NP-complete problems / Graph coloring / Cograph / Clique / Matching / Pathwidth


Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3
Add to Reading List

Document Date: 2015-02-26 04:11:59


Open Document

File Size: 317,63 KB

Share Result on Facebook