A Linear-Time Algorithm for Testing Outer-1-Planarity? Seok-Hee Hong1 , Peter Eades1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1

First Page		Document Content
Graph theory Planar graphs SPQR tree 1-planar graph Topological graph theory Connectivity Dual graph Subhamiltonian graph		A Linear-Time Algorithm for Testing Outer-1-Planarity? Seok-Hee Hong1 , Peter Eades1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1 Add to Reading List Source URL: www.cs.usyd.edu.au Download Document from Source Website File Size: 1,24 MB Share Document on Facebook

	The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin DocID: 1rfkH - View Document
	Specral Graph Theory and its Applications September 2, 2004 Lecture 1 Lecturer: Daniel A. Spielman DocID: 1rav7 - View Document
	A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a DocID: 1ra7T - View Document
	Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p DocID: 1r43q - View Document
	Straight-line Drawings of 1-planar Graphs Peter Eades1 , Seok-Hee Hong1 , Giuseppe Liotta2 , and Sheung-Hung Poon3 1 3 DocID: 1qwmK - View Document