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

	Sage Reference Manual: Matroid Theory Release 8.3 The Sage Development Team DocID: 1uyEs - 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
	ANALYTIC ZARISKI STRUCTURES AND NON-ELEMENTARY CATEGORICITY BORIS ZILBER Abstract. We study analytic Zariski structures from the point of view of non-elementary model theory. We show how to associate an abstract elementa DocID: 1rpNY - View Document
	Bonn Workshop on Combinatorial Optimization Wednesday, November 5th, 2008 Chair: Minyi Yue 09.00 – 09.30 DocID: 1rla1 - View Document
	Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡ DocID: 1rdvb - View Document