UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit

First Page		Document Content
Date: 2008-07-03 09:38:15 Graph theory Planar graphs SPQR tree Planarization Dual graph Topological graph theory Biconnected graph Simultaneous embedding Planarity testing		UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit Add to Reading List Source URL: ls11-www.cs.tu-dortmund.de Download Document from Source Website File Size: 1,11 MB Share Document on Facebook

	The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) DocID: 1v4B2 - View Document
	Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org DETERMINISTICALLY ISOLATING A PERFECT MATCHING IN BIPARTITE PLANAR GRAPHS SAMIR DATTA 1 , RAGHAV KULKARNI 2 , AND SAMBU DocID: 1uYYo - View Document
	Subexponential parameterized algorithms on planar graphs via low-treewidth pattern covering Dániel Marx (joint work with Fedor Fomin, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh) DocID: 1uVYI - View Document
	The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) DocID: 1uSoc - View Document
	Stars and bunches in planar graphs. Part II : General planar graphs and colourings ∗ O. V. Borodin,1 H. J. Broersma,2 DocID: 1uzoK - View Document