Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma

First Page		Document Content
Date: 2011-07-20 16:48:47 Graph theory Graph operations NP-complete problems Chordal graph Clique Graph minor Edge contraction Tree decomposition Vertex Split graph Graph Independent set		Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma Add to Reading List Source URL: rutcor.rutgers.edu Download Document from Source Website File Size: 233,60 KB Share Document on Facebook

	On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡ DocID: 1rf09 - View Document
	Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma DocID: 1qMoS - 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
	Marcin Jakub Kaminski ´ Université Libre de Bruxelles Département d’Informatique Bvd. du Triomphe, CPBruxelles DocID: 1pBY8 - View Document
	In IEEE Transactions on PAMI, Vol. 26, No. 9, pp, Septp.1 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for DocID: 1paZS - View Document