Closure and Hamilton-connected claw-free hourglass-free graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43926347" target="_blank" >RIV/49777513:23520/15:43926347 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00373-014-1490-5" target="_blank" >http://dx.doi.org/10.1007/s00373-014-1490-5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00373-014-1490-5" target="_blank" >10.1007/s00373-014-1490-5</a>

Result language
angličtina
Original language name
Closure and Hamilton-connected claw-free hourglass-free graphs
Original language description
The closure cl(G) of a claw-free graph G is the graph obtained from G by a series of local completions at eligible vertices, as long as this is possible. The construction of an SM-closure of G follows the same operations, but if G is not Hamilton-connected, then the construction terminates once every local completion at an eligible vertex leads to a Hamilton-connected graph. Although cl(G) may be Hamilton-connected even if G is not, we show that if G is a 2-connected claw-free graph with minimum degreeat least 3 such that its SM-closure is hourglass-free, then G is Hamilton-connected if and only if the closure cl(G) of G is Hamilton-connected.
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
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)