- Sparse Kneser graphs are Hamiltonian
2020/12/10 by Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak · 1 citation
Mathematics · Engineering · Computer Science · #Limits and Structures in Graph Theory #graph theory and CDMA systems #Topological and Geometric Data Analysis #Combinatorics #Mathematics #Hamiltonian path #Odd graph #Disjoint sets #Hypergraph #Discrete mathematics #Graph #Complete graph #Chordal graph #1-planar graph
- Cycle systems in the complete bipartite graph minus a one-factor
2004/06/02 by Dan Archdeacon, Marisa Debowsky, Jeff Dinitz +1 · 1 citation
Computer Science · Engineering · Mathematics · #Bipartite graph #Coding theory and cryptography #Combinatorics #Complete bipartite graph #Complete graph #Discrete mathematics #Graph #Graph power #Limits and Structures in Graph Theory #Line graph #Mathematics #Partition (number theory) #Wheel graph #graph theory and CDMA systems