On 1-Hamilton-connected claw-free graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43920193" target="_blank" >RIV/49777513:23520/14:43920193 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S0012365X13005104" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0012365X13005104</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2013.12.009" target="_blank" >10.1016/j.disc.2013.12.009</a>

Result language
angličtina
Original language name
On 1-Hamilton-connected claw-free graphs
Original language description
A graph G is k-Hamilton-connected (k-hamiltonian) if the graph G-X is Hamilton-connected (hamiltonian) for every set of vertices X with |X| = k. In the paper, we prove that (i) every 5-connected claw-free graph with minimum degree at least 6 is 1-Hamilton-connected, (ii) every 4-connected claw-free hourglass-free graph is 1-Hamilton-connected. As a byproduct, we also show that every 5-connected line graph with minimum degree at least 6 is 3-hamiltonian.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)