Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗

First Page		Document Content
Date: 2013-10-25 09:59:52 Chordal graph Clique Maximal independent set Split graph Tree decomposition Cograph Independent set Neighbourhood Clique-sum Graph theory Graph operations NP-complete problems		Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗ Add to Reading List Source URL: www.ii.uib.no Download Document from Source Website File Size: 374,99 KB Share Document on Facebook

	Prof. Dr. Petra Scheffler FH Stralsund, FB Wirtschaft Wissenschaftliche Vorträge DocID: 1rsjv - View Document
	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont DocID: 1rlxP - View Document
	On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡ DocID: 1rf09 - View Document
	Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick DocID: 1r7Hx - View Document
	New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School DocID: 1qQA2 - View Document