Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1

First Page		Document Content
Date: 2011-07-20 16:50:25 Graph 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 1 Add to Reading List Source URL: rutcor.rutgers.edu Download Document from Source Website File Size: 405,77 KB Share Document on Facebook

	Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1 DocID: 1qvfC - View Document
	Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam DocID: 1qr87 - View Document
	The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2 DocID: 1pX1E - View Document
	Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time DocID: 1pIzb - View Document