On Toughness and Hamiltonicity of 2K2-Free Graphs-Reference-Cited by-同舟云学术

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

On Toughness and Hamiltonicity of 2K2-Free Graphs

Published:2013-02-19 Issue:3 Volume:75 Page:244-255
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Broersma Hajo¹,Patel Viresh²,Pyatkin Artem³

Affiliation:

1. FACULTY OF EEMCS; UNIVERSITY OF TWENTE; P.O. BOX 217, 7500 AE ENSCHEDE THE NETHERLANDS

2. SCHOOL OF MATHEMATICS; UNIVERSITY OF BIRMINGHAM; EDGBASTON BIRMINGHAM B15 2TT UNITED KINGDOM

3. SOBOLEV INSTITUTE OF MATHEMATICS; PR-T KOPTYUGA 4, NOVOSIBIRSK 630090 RUSSIA

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference18 articles.

1. Toughness in graphs-A survey;Bauer;Graphs Combin,2006

2. Not every 2-tough graph is hamiltonian;Bauer;Discrete Appl Math,2000

3. Recognizing tough graphs is NP-hard;Bauer;Discrete Appl Math,1990

4. Tough enough chordal graphs are hamiltonian;Chen;Networks,1998

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

1. An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth;Graphs and Combinatorics;2024-08-22

2. An Ore-Type Condition for Hamiltonicity in Tough Graphs and the Extremal Examples;The Electronic Journal of Combinatorics;2024-03-08

3. Some conditions for hamiltonian cycles in 1-tough (K2 ∪ kK1)-free graphs;Discrete Mathematics;2024-03

4. Hamiltonicity of 1-tough (P2 ∪ kP1)-free graphs;Discrete Mathematics;2024-02

5. Edge Contraction and Forbidden Induced Subgraphs;AIRO Springer Series;2024

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP