<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Graph theory Kneser graph Petersen graph Odd graph Hamiltonian path Graph Cycle Planar graphs Desargues graph Polyhedral graph |
Add to Reading List |
| First Page | Document Content | |
|---|---|---|
Graph theory Kneser graph Petersen graph Odd graph Hamiltonian path Graph Cycle Planar graphs Desargues graph Polyhedral graph |
Add to Reading List |
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 ![Eigenspaces of Graphs. By Dragos Cvetkovic, Peter Rowlinson, and Slobodan Simic. Cambridge University Press, Cambridge, UK, 1997. $[removed]xiii+258 pp., hardback. ISBN[removed]This volume continues a series of monog](https://www.pdfsearch.io/img/9648eebfe5e85cd47ef530c61a7465bb.jpg "Eigenspaces of Graphs. By Dragos Cvetkovic, Peter Rowlinson, and Slobodan Simic. Cambridge University Press, Cambridge, UK, 1997. $[removed]xiii+258 pp., hardback. ISBN[removed]This volume continues a series of monog")
