Forbidden subgraphs, stability and hamiltonicity

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F99%3A00039211" target="_blank" >RIV/49777513:23520/99:00039211 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Forbidden subgraphs, stability and hamiltonicity

Original language description

We study the stability of some classes of claw-free graphs defined in terms of forbidden subgraphs under the closure operation defined by the second author. We characterize all connected graphs A such that the class of all CA-free graphs (where C denotesthe claw) is stable. Using this result, we prove that every 2-connected and CHP_8-free, CHZ_5-free or CHN_{1,1,4}-free graph is either hamiltonian or belongs to some classes of exceptional graphs (all of them having connectivity 2).

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F97%2F0407" target="_blank" >GA201/97/0407: Global properties of locally characterized classes of graphs</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

1999

Confidentiality

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

Name of the periodical

Discrete Mathematics

ISSN

0012365X

e-ISSN

—

Volume of the periodical

Vol.^197/1

Issue of the periodical within the volume

1

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

13

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—