Closure concept for 2-factors in claw-free graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F10%3A00503452" target="_blank" >RIV/49777513:23520/10:00503452 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Closure concept for 2-factors in claw-free graphs

Original language description

We introduce a closure concept for 2-factors in claw-free graphs that generalizes the closure introduced by the first author. The 2-factor closure of a graph is uniquely determined and the closure operation turns a claw-free graph into the line graph ofa graph containing no cycles of length at most 5 and no cycles of length 6 satisfying a certain condition. A graph has a 2-factor if and only if its closure has a 2-factor; however, the closure operation preserves neither the minimum number of componentsof a 2-factor nor the hamiltonicity or nonhamiltonicity of a graph.

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/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)

Publication year

2010

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

0012-365X

e-ISSN

—

Volume of the periodical

310

Issue of the periodical within the volume

10-11

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

7

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—