Large Sets of Wrapped K-K Hamilton Cycle Decompositions of Complete Bipartite 3-Uniform Hypergraphs
Author:
Affiliation:
1. School of Mathematics and Physics; North China Electric Power University; Beijing 102206 P. R. China
2. Department of Mathematics and Statistics; 221 Parker Hall, Auburn University; Auburn Alabama 36849
Funder
NSFC
Fundamental Research Funds for the Central Universities
China Scholarship Council and the Co-construction Project of Beijing Municipal Commission of Education
Publisher
Wiley
Subject
Discrete Mathematics and Combinatorics
Link
http://onlinelibrary.wiley.com/wol1/doi/10.1002/jcd.21423/fullpdf
Reference18 articles.
1. The wonderful Walecki construction;Alspach;Bull Inst Combin Appl,2008
2. Cycle decompositions of Kn and Kn−I;Alspach;J Combin Theory Ser B,2001
3. Hamiltonian decomposition of complete k-uniform hypergraphs;Bailey;Discrete Math,2010
4. C. Berge Graphes et hypergraphes 1970
5. J. C. Bermond A. Germa M. C. Heydemann D. Sotteau Hypergraphes hamiltoniens 1978
Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Large Sets of Hamilton Cycle Decompositions of a Class of Uniform Hypergraphs;Journal of Physics: Conference Series;2023-03-01
2. Large sets of Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs;Journal of Combinatorial Designs;2018-10-07
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3