On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

First Page		Document Content
Date: 2009-04-29 03:46:21 Graph theory Graph operations Graph coloring Matroid theory Edge contraction Graph Bipartite graph Ear decomposition Pathwidth Line graph		On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´ Add to Reading List Source URL: kam.mff.cuni.cz Download Document from Source Website File Size: 168,71 KB Share Document on Facebook

	Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth David Coudert, Dorian Mazauric, Nicolas Nisse To cite this version: DocID: 1tqya - View Document
	On Self Duality of Pathwidth in Polyhedral Graph Embeddings Fedor V. Fomin1 and Dimitrios M. Thilikos2 1 DEPARTMENT OF INFORMATICS DocID: 1t8i4 - View Document
	Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos DocID: 1rq3s - 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
	Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France DocID: 1r6mN - View Document