On the size of the Euclidean sphere of in uence graph Michael A. Soss School of Computer Science McGill University Montreal, Canada May 14, 1999

First Page		Document Content
Date: 2003-06-20 16:00:28 Planar graphs Geometric graph theory Differential topology Elementary geometry Sphere Topology De Bruijn–Erdős theorem Circle packing theorem Geometry Mathematics Graph theory		On the size of the Euclidean sphere of in uence graph Michael A. Soss School of Computer Science McGill University Montreal, Canada May 14, 1999 Add to Reading List Source URL: www.cccg.ca Download Document from Source Website File Size: 151,07 KB Share Document on Facebook

	A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012 DocID: 1rs14 - View Document
	Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer DocID: 1rrUb - 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
	Contractibility and Self-Intersections of Curves on Surfaces David de Laat Bachelor Thesis in Mathematics DocID: 1r3nI - View Document
	COCOMPACTLY CUBULATED GRAPH MANIFOLDS MARK F. HAGEN∗ AND PIOTR PRZYTYCKI† Abstract. Let M be a graph manifold. We show that π1 M is the fundamental group of a compact nonpositively curved cube complex if and only if DocID: 1r06N - View Document