On the Minimum Number of Hamiltonian Cycles in Regular Graphs
Author:
Affiliation:
1. School of Computer Science, Engineering and Mathematics, Flinders University, Tonsley, Australia
Publisher
Informa UK Limited
Subject
General Mathematics
Link
https://www.tandfonline.com/doi/pdf/10.1080/10586458.2017.1306813
Reference13 articles.
1. [Biggs 93] N. L. Biggs. Algebraic Graph Theory, 2nd ed. Cambridge, UK: Cambridge University Press, 1993.
2. Non-Sexist Solution of the Menage Problem
3. [Chalaturnyk 08] A. Chalaturnyk. “A Fast Algorithm for Finding Hamilton Cycles.” Masters Thesis, University of Manitoba, 2008.
4. The Traveling Salesman Problem for Cubic Graphs
5. The Planar Hamiltonian Circuit Problem is NP-Complete
Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs;Discrete Applied Mathematics;2024-10
2. Few hamiltonian cycles in graphs with one or two vertex degrees;Mathematics of Computation;2024-02-02
3. The ratio of the numbers of odd and even cycles in outerplanar graphs;Discrete Mathematics;2023-04
4. From One to Many Rainbow Hamiltonian Cycles;Graphs and Combinatorics;2022-11-16
5. Regular Graphs with Few Longest Cycles;SIAM Journal on Discrete Mathematics;2022-03
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3