Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected (Q2142647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected |
scientific article |
Statements
Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected (English)
0 references
27 May 2022
0 references
The following conjecture was posed by \textit{W. Zheng} et al. [Discrete Math. 343, No. 1, Article ID 111644, 9 p. (2020; Zbl 1429.05116)]: Every 3-connected claw-free graph with domination number at most 2 is Hamiltonian-connected. In this paper, the authors prove the following stronger theorem which is sharp: Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected. Note that the graphs may admit multiple edges.
0 references
domination number
0 references
claw-free graph
0 references
Hamiltonian-connected graph
0 references
0 references
