Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F22%3A43966026" target="_blank" >RIV/49777513:23520/22:43966026 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0012365X22001157" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0012365X22001157</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2022.112909" target="_blank" >10.1016/j.disc.2022.112909</a>
Alternative languages
Result language
angličtina
Original language name
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA20-09525S" target="_blank" >GA20-09525S: Structural properties of graph classes characterized by forbidden subgraphs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics
ISSN
0012-365X
e-ISSN
1872-681X
Volume of the periodical
345
Issue of the periodical within the volume
8
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
4
Pages from-to
nestrankovano
UT code for WoS article
000792690200004
EID of the result in the Scopus database
2-s2.0-85128850766