Journal of Universal Computer Science, vol. 3, no), submitted: 8 8 97, accepted: , appeared:  Springer Pub. Co. A Note on the Computability of Graph Minor Obstruction Sets for Mona - Forbidden - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2009-10-14 09:38:23 Path decomposition Minor Tree Edge contraction Forbidden graph characterization Graph Neighbourhood Planar graph Connectivity Graph theory Graph operations Robertson–Seymour theorem		Journal of Universal Computer Science, vol. 3, no), submitted: 8/8/97, accepted: , appeared:  Springer Pub. Co. A Note on the Computability of Graph Minor Obstruction Sets for Mona Add to Reading List Source URL: www.mrfellows.net Download Document from Source Website File Size: 160,48 KB Share Document on Facebook

	Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1 DocID: 1qTAq - View Document
	Graph minors, decompositions and algorithms (Lecture notes) Jiˇr´ı Fiala Department of Applied Mathematics, Charles University, Prague DocID: 1oErr - View Document
	Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro DocID: 1nnnC - View Document
	Region Counting Graphs Jean Cardinal∗ S´ebastien Collette† Abstract DocID: 1lXi2 - View Document
	On Forbidden Subdivision Characterization of Graph Classes Zdenˇek Dvoˇra´k Charles University, Faculty of Mathematics and Physics, Institute for Theoretical Computer Science (ITI) 1 Malostransk´e n´ DocID: 1kYcG - View Document