2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43924804" target="_blank" >RIV/49777513:23520/15:43924804 - isvavai.cz</a>

Result on the web

<a href="http://link.springer.com/article/10.1007%2Fs00373-013-1375-z" target="_blank" >http://link.springer.com/article/10.1007%2Fs00373-013-1375-z</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s00373-013-1375-z" target="_blank" >10.1007/s00373-013-1375-z</a>

Result language

angličtina

Original language name

2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths

Original language description

In this article, we prove that every claw-free graph G with minimum degree at least 4 has a 2-factor in which each cycle contains at least lceilfrac{delta(G) - 1}{2}rceil vertices and every 2-connected claw-free graph G with minimum degree at least 3has a 2-factor in which each cycle contains at least delta(G) vertices. For the case where G is 2-connected, the lower bound on the length of a cycle is best possible.

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/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2015

Confidentiality

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

Name of the periodical

GRAPHS AND COMBINATORICS

ISSN

0911-0119

e-ISSN

—

Volume of the periodical

31

Issue of the periodical within the volume

1

Country of publishing house

JP - JAPAN

Number of pages

15

Pages from-to

99-113

UT code for WoS article

000346776200007

EID of the result in the Scopus database

—