![Graph theory / Kneser graph / Petersen graph / Odd graph / Hamiltonian path / Graph / Cycle / Planar graphs / Desargues graph / Polyhedral graph Graph theory / Kneser graph / Petersen graph / Odd graph / Hamiltonian path / Graph / Cycle / Planar graphs / Desargues graph / Polyhedral graph](https://www.pdfsearch.io/img/93a8599664e019fcdfbc931b41db220f.jpg) 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 ListSource URL: page.math.tu-berlin.deDownload Document from Source Website File Size: 34,64 KBShare Document on Facebook
|