First Page | Document Content | |
---|---|---|
Date: 2009-10-06 02:54:05Robertson–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, CanadaAdd to Reading ListSource URL: www.mrfellows.netDownload Document from Source WebsiteFile Size: 171,17 KBShare Document on Facebook |