Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Cycle decompositions of Kn and Kn−I;Alspach;J. Combin. Theory Ser. B,2001
2. A short proof of Kneser’s conjecture;Bárány;J. Combin. Theory Ser. A,1978
3. Short path decompositions of arbitrary complete multipartite graphs;Billington;Congr. Numer.,2007
4. Kneser graphs are Hamiltonian for n≥3k;Chen;J. Combin. Theory Ser. B,2000
5. Cyclic decompositions of complete graphs into spanning trees;Froncek;Discuss. Math. Graph Theory,2004
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献