Hamiltonian properties of polyhedra with few 3-cuts—A survey
Author:
Funder
JST ERATO
JSPS KAKENHI
Postdoctoral Fellowship of the Research Foundation Flanders
Publisher
Elsevier BV
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference75 articles.
1. Chordal and timbral morphologies using Hamiltonian cycles;Akhmedova;J. Math. Music,2014
2. Cycles through 23 vertices in 3-connected cubic planar graphs;Aldred;Graphs Combin.,1999
3. Nonhamiltonian 3-connected cubic planar graphs;Aldred;SIAM J. Discrete Math.,2000
4. A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs;Asano;Discrete Appl. Math.,1984
5. Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes;Bae;IEEE Trans. Comput.,2003
Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polyhedra without cubic vertices are prism‐hamiltonian;Journal of Graph Theory;2024-02-19
2. The ratio of the numbers of odd and even cycles in outerplanar graphs;Discrete Mathematics;2023-04
3. On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs;Journal of Graph Theory;2022-07-21
4. Circumscribing Polygons and Polygonizations for Disjoint Line Segments;Discrete & Computational Geometry;2022-01-31
5. Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number – A Survey;Discrete and Computational Geometry, Graphs, and Games;2021
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3