Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. On the factorization of the complete uniform hypergraph;Baranyai;Colloq. Math. Soc. János Bolyai,1975
2. Hamiltonian uniform subset graphs;Chen;J. Combin. Theory Ser. B,1987
3. Extremal Problems in Graph Theory: Hamiltonicity, Minimum Vertex-Diameter-2-Critical Graphs and Decomposition;Chen,2000
4. A note on Hamiltonian circuits;Chvátal;Discrete Math.,1972
5. Binomial and Q-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their q-analogues;Clark;J. Combin. Theory Ser. A,1996
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A note on the 1-factorization of non-uniform complete hypergraph;Applied Mathematics and Computation;2025-01
2. A note on Pk-decomposition of the Kneser graph;Discrete Mathematics, Algorithms and Applications;2024-08-09
3. Disjointness graphs of segments in R2 are almost all hamiltonian;Discrete Applied Mathematics;2024-01
4. Kneser Graphs Are Hamiltonian;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. On the central levels problem;Journal of Combinatorial Theory, Series B;2023-05