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

First Page		Document Content
Date: 2012-05-06 07:54:01 Graph theory Graph coloring Graph operations Matroid theory Graph connectivity Pathwidth Graph minor Ear decomposition Treewidth Tree decomposition Edge contraction Branch-decomposition		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 Add to Reading List Source URL: rutcor.rutgers.edu Download Document from Source Website File Size: 298,10 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