Forbidden subgraphs, hamiltonicity and closure in claw - free graphs

Result code in IS VaVaI

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

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Forbidden subgraphs, hamiltonicity and closure in claw - free graphs

Original language description

We study the stability of some classes of graphs defined in terms of forbidden subgraphs under the closure operation introduced by the second author. Using these results, we prove that every 2-connected claw-free and P_7-free, or claw-free and Z_4-free,r claw-free and eiffel-free graph is either hamiltonian or belongs to a certain class of exceptions (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.^196

Issue of the periodical within the volume

1

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

22

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—