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

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

Published:2022-08-08 Issue:1 Volume:102 Page:154-179
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. School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing P.R. China

2. School of Mathematics and Statistics Northwestern Polytechnical University Xi'an Shaanxi P.R. China

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

4. School of Mathematics and Statistics Henan University Kaifeng P.R. 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.22863

Reference31 articles.

1. Cycles containing a set of elements in cubic graphs;Bau S.;Australas. J. Combin.,1990

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

3. Cycles containing 12 vertices in 3-connected cubic graphs

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

5. Closure and Hamiltonian-connectivity of claw-free graphs

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

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

2. Hamilton-connected claw-free graphs with Ore-degree conditions;Discrete Applied Mathematics;2023-12

3. Hamilton‐connected {claw,net}‐free graphs, II;Journal of Graph Theory;2022-11-11