First Page | Document Content | |
---|---|---|
Date: 2011-07-20 16:50:25Graph theory Mathematics NP-complete problems Graph operations Graph coloring Graph Edge contraction Longest path problem Vertex Cycle Line graph Vertex cover | Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1Add to Reading ListSource URL: rutcor.rutgers.eduDownload Document from Source WebsiteFile Size: 405,77 KBShare Document on Facebook |