University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics

First Page		Document Content
Date: 2009-05-14 05:33:59 Configurations Levi graph Petersen graph Möbius–Kantor graph Desargues graph Incidence structure Cayley graph Graph Heawood graph Graph theory Mathematics Combinatorics		University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Add to Reading List Source URL: www.imfm.si Download Document from Source Website File Size: 487,18 KB Share Document on Facebook

	Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆ DocID: 1rec7 - View Document
	Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that DocID: 1r5gC - View Document
	A PRACTICAL GUIDE TO DRAWING AND COMPUTING WITH COMPLEX NETWORKS ROSS M. RICHARDSON Abstract. These notes are an attempt to document various graph drawing resources which I have compiled in the course of my work. They ar DocID: 1pz20 - View Document
	Symmetry Detection in General Game Playing Stephan Schiffel Department of Computer Science Dresden University of Technology DocID: 1pjrG - View Document
	M:RA35_31FINITCE IALA IALA.dvi DocID: 1p36l - View Document