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 - Audacious - Document - PDFSEARCH.IO

First Page		Document Content
Graph theory Kneser graph Petersen graph Odd graph Hamiltonian path Graph Cycle Planar graphs Desargues graph Polyhedral graph		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 Download Document from Source Website File Size: 34,64 KB Share Document on Facebook