Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em

First Page		Document Content
Date: 2014-04-12 04:53:59 Graph theory Algebraic graph theory Vertex-transitive graph Hadwiger number Graph minor Graph End Symmetric graph Planar graph		Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 48,01 KB Share Document on Facebook

	„ ´ Strengthening Erdos–Posa Property for Minor-Closed Graph Classes Fedor V. Fomin,1 Saket Saurabh,2 and Dimitrios M. Thilikos3 DocID: 1sVvX - 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
	Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA { DocID: 1revt - View Document
	Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory DocID: 1rcqn - View Document
	CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS STRUCTURE AND COMPLEXITY DocID: 1r79Q - View Document