Strengthening the closure concept in claw-free graphs

Result code in IS VaVaI

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

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Strengthening the closure concept in claw-free graphs

Original language description

We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G defined here is uniquely determined and preserves the value of the circumference of G. We present an infinite family of graphs with n vertices and 3/2 n-1 edges for which the new closure is the complete graph K_n.

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

Issue of the periodical within the volume

leden

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

9

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—