Induced Subgraphs with Large Degrees at End-vertices for Hamiltonicity of Claw-free Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F16%3A43929858" target="_blank" >RIV/49777513:23520/16:43929858 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/article/10.1007/s10114-016-4686-1" target="_blank" >http://link.springer.com/article/10.1007/s10114-016-4686-1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10114-016-4686-1" target="_blank" >10.1007/s10114-016-4686-1</a>
Alternative languages
Result language
angličtina
Original language name
Induced Subgraphs with Large Degrees at End-vertices for Hamiltonicity of Claw-free Graphs
Original language description
The paper gives a full characterization of all graphs H such that a 2-connected claw-free graph G is Hamiltonian if each end-vertex of every induced copy of H in G has degree at least |V(G)|/3+1.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
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
2016
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
ACTA MATHEMATICA SINICA-ENGLISH SERIES
ISSN
1439-8516
e-ISSN
—
Volume of the periodical
32
Issue of the periodical within the volume
7
Country of publishing house
CN - CHINA
Number of pages
11
Pages from-to
845-855
UT code for WoS article
000377109800009
EID of the result in the Scopus database
2-s2.0-84975523921