A note on 3-connected hourglass-free claw-free Hamilton-connected graphs

Xia Liu; Liming Xiong

doi:10.1016/j.disc.2022.112910

A note on 3-connected hourglass-free claw-free Hamilton-connected graphs

Xia Liu
, Liming Xiong^*

^*Corresponding author for this work

School of Mathematics and Statistics

Northwestern Polytechnical University Xian
Northwest Normal University

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

An hourglass Γ₀ is the graph with degree sequence (4, 2, 2, 2, 2) and a claw is the bipartite complete graph K_1,3. In this paper, we show that (1) every 3-connected, essentially 4-connected {K_1,3,Γ₀}-free graph is Hamilton-connected, (2) every 3-connected {K_1,3,Γ₀,P₁₆}-free graph is Hamilton-connected, where (1) improves similar results of (Li et al. (2008) [11]) and hence (Broersma et al. (2001) [4]); (2) settles one conjecture posed in (Ryjáček et al. (2018) [18]).

Original language	English
Article number	112910
Journal	Discrete Mathematics
Volume	345
Issue number	8
DOIs	https://doi.org/10.1016/j.disc.2022.112910
Publication status	Published - Aug 2022

Keywords

Hamilton-connected
Hourglass-free
Line graph
SM-closure
Strongly spanning trailable

Access to Document

10.1016/j.disc.2022.112910

Cite this

@article{8343368b9413444ab4e912a6dab31768,

title = "A note on 3-connected hourglass-free claw-free Hamilton-connected graphs",

abstract = "An hourglass Γ0 is the graph with degree sequence (4, 2, 2, 2, 2) and a claw is the bipartite complete graph K1,3. In this paper, we show that (1) every 3-connected, essentially 4-connected \{K1,3,Γ0\}-free graph is Hamilton-connected, (2) every 3-connected \{K1,3,Γ0,P16\}-free graph is Hamilton-connected, where (1) improves similar results of (Li et al. (2008) [11]) and hence (Broersma et al. (2001) [4]); (2) settles one conjecture posed in (Ryj{\'a}{\v c}ek et al. (2018) [18]).",

keywords = "Hamilton-connected, Hourglass-free, Line graph, SM-closure, Strongly spanning trailable",

author = "Xia Liu and Liming Xiong",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",

year = "2022",

month = aug,

doi = "10.1016/j.disc.2022.112910",

language = "English",

volume = "345",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "8",

}

TY - JOUR

T1 - A note on 3-connected hourglass-free claw-free Hamilton-connected graphs

AU - Liu, Xia

AU - Xiong, Liming

PY - 2022/8

Y1 - 2022/8

N2 - An hourglass Γ0 is the graph with degree sequence (4, 2, 2, 2, 2) and a claw is the bipartite complete graph K1,3. In this paper, we show that (1) every 3-connected, essentially 4-connected {K1,3,Γ0}-free graph is Hamilton-connected, (2) every 3-connected {K1,3,Γ0,P16}-free graph is Hamilton-connected, where (1) improves similar results of (Li et al. (2008) [11]) and hence (Broersma et al. (2001) [4]); (2) settles one conjecture posed in (Ryjáček et al. (2018) [18]).

AB - An hourglass Γ0 is the graph with degree sequence (4, 2, 2, 2, 2) and a claw is the bipartite complete graph K1,3. In this paper, we show that (1) every 3-connected, essentially 4-connected {K1,3,Γ0}-free graph is Hamilton-connected, (2) every 3-connected {K1,3,Γ0,P16}-free graph is Hamilton-connected, where (1) improves similar results of (Li et al. (2008) [11]) and hence (Broersma et al. (2001) [4]); (2) settles one conjecture posed in (Ryjáček et al. (2018) [18]).

KW - Hamilton-connected

KW - Hourglass-free

KW - Line graph

KW - SM-closure

KW - Strongly spanning trailable

UR - https://www.scopus.com/pages/publications/85127196633

U2 - 10.1016/j.disc.2022.112910

DO - 10.1016/j.disc.2022.112910

M3 - Article

AN - SCOPUS:85127196633

SN - 0012-365X

VL - 345

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 8

M1 - 112910

ER -

A note on 3-connected hourglass-free claw-free Hamilton-connected graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this