Claw-free graphs with complete closure

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F01%3A00064944" target="_blank" >RIV/49777513:23520/01:00064944 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Claw-free graphs with complete closure

Original language description

We study some properties of the closure concept in claw-free graphs that was introduced by the first author. We show several structural properties of claw-free graphs with complete closure and their clique cutsets and, using these results, we prove thatevery claw-free graph on n vertices with complete closure contains a cycle of length n-1.

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

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2001

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. 236

Issue of the periodical within the volume

leden

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

14

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—