Hamilton‐connected {claw,net}‐free graphs, II-Reference-Cited by-同舟云学术

Hamilton‐connected {claw,net}‐free graphs, II

Published:2022-11-11 Issue:1 Volume:103 Page:119-138
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:Journal of Graph Theory

Author:

Liu Xia¹²,Ryjáček Zdeněk³^ORCID,Vrána Petr³^ORCID,Xiong Liming¹^ORCID,Yang Xiaojing⁴

Affiliation:

1. Department of Applied Mathematics, School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing People's Republic of China

2. Department of Mathematics Northwest Normal University Lanzhou Gansu People's Republic of China

3. Department of Mathematics, European Centre of Excellence NTIS—New Technologies for the Information Society University of West Bohemia Pilsen Czech Republic

4. Department of Mathematics Henan University Kaifeng People's Republic of China

Funder

National Natural Science Foundation of China

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.22907

Reference20 articles.

1. On cycles containing eight vertices and an edge in 3‐connected cubic graphs;Bau S.;Ars Comb.,1988

2. 3-Connected {K 1,3, P 9}-Free Graphs are Hamiltonian-Connected

3. Graph Theory

4. Forbidden subgraphs that imply hamiltonian-connectedness

5. Forbidden subgraphs, hamiltonicity and closure in claw-free graphs

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

1. A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs;Discrete Mathematics;2024-11

2. Hamilton‐connected {claw, bull}‐free graphs;Journal of Graph Theory;2022-08-08