Every 3-connected {K(1,3), Z(7)}-free graph of order at least 21 is Hamilton-connected
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F21%3A43961311" target="_blank" >RIV/49777513:23520/21:43961311 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0012365X21000637?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0012365X21000637?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2021.112350" target="_blank" >10.1016/j.disc.2021.112350</a>
Alternative languages
Result language
angličtina
Original language name
Every 3-connected {K(1,3), Z(7)}-free graph of order at least 21 is Hamilton-connected
Original language description
For a positive integer i, Z(i) is the graph obtained by attaching an endvertex of a path of length i to a vertex of a triangle. We prove that every 3-connected {K(1,3), Z(7)}-free graph is Hamilton-connected, with one exceptional graph. The result is sharp.I
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
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
—
Volume of the periodical
344
Issue of the periodical within the volume
6
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
16
Pages from-to
—
UT code for WoS article
000640570000020
EID of the result in the Scopus database
2-s2.0-85101530411