Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected

Petr Vrána; Xingzhi Zhan; Leilei Zhang

doi:10.1016/j.disc.2022.112909

Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected

Petr Vrána
, Xingzhi Zhan^*
, Leilei Zhang

^*Corresponding author for this work

School of Mathematical Sciences

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

2 Scopus citations

Abstract

We prove that every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. The result is sharp and it is inspired by a conjecture posed by Zheng, Broersma, Wang and Zhang in 2020.

Original language	English
Article number	112909
Journal	Discrete Mathematics
Volume	345
Issue number	8
DOIs	https://doi.org/10.1016/j.disc.2022.112909
State	Published - Aug 2022

Keywords

Claw-free
Domination number
Hamiltonian-connected

Access to Document

10.1016/j.disc.2022.112909

Cite this

@article{6f5f3966f26f43eaa5a94702dd7f6dd4,

title = "Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected",

abstract = "We prove that every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. The result is sharp and it is inspired by a conjecture posed by Zheng, Broersma, Wang and Zhang in 2020.",

keywords = "Claw-free, Domination number, Hamiltonian-connected",

author = "Petr Vr{\'a}na and Xingzhi Zhan and Leilei Zhang",

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

year = "2022",

month = aug,

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

language = "英语",

volume = "345",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "8",

}

TY - JOUR

T1 - Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected

AU - Vrána, Petr

AU - Zhan, Xingzhi

AU - Zhang, Leilei

PY - 2022/8

Y1 - 2022/8

N2 - We prove that every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. The result is sharp and it is inspired by a conjecture posed by Zheng, Broersma, Wang and Zhang in 2020.

AB - We prove that every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. The result is sharp and it is inspired by a conjecture posed by Zheng, Broersma, Wang and Zhang in 2020.

KW - Claw-free

KW - Domination number

KW - Hamiltonian-connected

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

U2 - 10.1016/j.disc.2022.112909

DO - 10.1016/j.disc.2022.112909

M3 - 文章

AN - SCOPUS:85128850766

SN - 0012-365X

VL - 345

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 8

M1 - 112909

ER -

Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this