Calculating the number of Hamilton cycles in layered polyhedral graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Calculating the number of Hamilton cycles in layered polyhedral graphs

Published:2021-01-12 Issue:4 Volume:3 Page:
ISSN:2577-7408
Container-title:Computational and Mathematical Methods
language:en
Short-container-title:Comp and Math Methods

Author:

Wirz Lukas N.¹²^ORCID,Schwerdtfeger Peter²,Avery James³^ORCID

Affiliation:

1. Department of Chemistry University of Helsinki Helsinki Finland

2. Centre for Theoretical Chemistry and Physics The New Zealand Institute for Advanced StudyMassey University Auckland Auckland New Zealand

3. Niels Bohr Institute University of Copenhagen Copenhagen Denmark

Publisher

Wiley

Subject

Computational Mathematics,Computational Theory and Mathematics,Computational Mechanics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/cmm4.1142

Reference11 articles.

1. Reducibility among Combinatorial Problems

2. A search procedure for Hamilton paths and circuits;Rubin F;J ACM,1974

3. The Complexity of Enumeration and Reliability Problems

4. The complexity of counting self‐avoiding walks in subgraphs of two‐dimensional grids and hypercubes;Liśkiewicz M;Theor Comput Sci,2003

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Magnetically Induced Current Densities in π-Conjugated Porphyrin Nanoballs;The Journal of Physical Chemistry A;2022-10-21

2. Magnetically Induced Current Densities in Zinc Porphyrin Nanoshells;The Journal of Physical Chemistry A;2022-03-18

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP