Back to Results
First PageMeta Content
Robertson–Seymour theorem / Tree decomposition / Minor / Planar graph / Linkless embedding / Graph coloring / Graph structure theorem / Clique-sum / Graph theory / Graph operations / Path decomposition


On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada
Add to Reading List

Document Date: 2009-10-06 02:54:05

Open Document

File Size: 171,17 KB

Share Result on Facebook
UPDATE