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 thatAdd to Reading ListSource URL: page.math.tu-berlin.deDownload Document from Source WebsiteFile Size: 34,64 KBShare Document on Facebook |