Petersen graph

Results: 108



#Item
1Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague  Graph: G = (V , E ), V finite, E ⊆

Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2015-09-15 10:40:14
2Bachelor / 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

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

Add to Reading List

Source URL: page.math.tu-berlin.de

Language: English
3A 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

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

Add to Reading List

Source URL: math.ucsd.edu

Language: English - Date: 2008-09-14 22:41:39
4Symmetry Detection in General Game Playing Stephan Schiffel Department of Computer Science Dresden University of Technology

Symmetry Detection in General Game Playing Stephan Schiffel Department of Computer Science Dresden University of Technology

Add to Reading List

Source URL: ggp.stanford.edu

Language: English - Date: 2009-05-18 11:49:39
5M:�RA�35_31FINIT�CE	IALA	IALA.dvi

M:RA35_31FINITCE IALA IALA.dvi

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2007-12-02 16:52:35
6Neighborhood Unions and Independent Cycles Ronald J. Gould∗ Kazuhide Hirohata†  Paul Horn‡

Neighborhood Unions and Independent Cycles Ronald J. Gould∗ Kazuhide Hirohata† Paul Horn‡

Add to Reading List

Source URL: web.cs.du.edu

Language: English - Date: 2010-11-16 10:28:08
7Signatures and Efficient Proofs on Committed Graphs and NP-Statements Thomas Groß School of Computing Science, Newcastle University, UK  No Institute Given

Signatures and Efficient Proofs on Committed Graphs and NP-Statements Thomas Groß School of Computing Science, Newcastle University, UK No Institute Given

Add to Reading List

Source URL: fc15.ifca.ai

Language: English - Date: 2015-01-11 00:33:09
8Local Properties of Geometric Graphs Jean Cardinal 1 S´ebastien Collette 2 Stefan Langerman 3 Computer Science Department, Universit´e Libre de Bruxelles, CP212, Boulevard du Triomphe, 1050 Bruxelles, Belgium  Abstract

Local Properties of Geometric Graphs Jean Cardinal 1 S´ebastien Collette 2 Stefan Langerman 3 Computer Science Department, Universit´e Libre de Bruxelles, CP212, Boulevard du Triomphe, 1050 Bruxelles, Belgium Abstract

Add to Reading List

Source URL: www.ulb.ac.be

Language: English - Date: 2011-02-08 09:21:42
9

PDF Document

Add to Reading List

Source URL: homepages.ecs.vuw.ac.nz

Language: English - Date: 2010-05-03 16:43:24
10.,uc.eding _... of the 2004 American Control Conference :es!nn, Massachusetts J u n eJuly 2,2004  FrM12.4

.,uc.eding _... of the 2004 American Control Conference :es!nn, Massachusetts J u n eJuly 2,2004 FrM12.4

Add to Reading List

Source URL: www1.cs.columbia.edu

Language: English - Date: 2008-10-11 12:20:30