On Forbidden Pairs Implying Hamilton-Connectedness
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43917800" target="_blank" >RIV/49777513:23520/13:43917800 - isvavai.cz</a>
Result on the web
<a href="http://onlinelibrary.wiley.com/doi/10.1002/jgt.21645/abstract" target="_blank" >http://onlinelibrary.wiley.com/doi/10.1002/jgt.21645/abstract</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.21645" target="_blank" >10.1002/jgt.21645</a>
Alternative languages
Result language
angličtina
Original language name
On Forbidden Pairs Implying Hamilton-Connectedness
Original language description
Using the recently introduced closure concept for Hamilton-connectedness in claw-free graphs, we extend the list of pairs of connected graphs X; Y such that a graph G being (X, Y )-free implies G is Hamilton-connected if and only if G is 3-connected. Wediscuss the remaining open cases.
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
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2013
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
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
—
Volume of the periodical
72
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
19
Pages from-to
"327?345"
UT code for WoS article
—
EID of the result in the Scopus database
—