Circumferences and minimum degrees in 3-connected claw-free graphs

Ming Chu Li; Yongrui Cui; Liming Xiong; Yuan Tian; He Jiang; Xu Yuan

doi:10.1016/j.disc.2007.12.062

Circumferences and minimum degrees in 3-connected claw-free graphs

Ming Chu Li
, Yongrui Cui
, Liming Xiong^*
, Yuan Tian
, He Jiang
, Xu Yuan

^*Corresponding author for this work

School of Mathematics and Statistics

Dalian University of Technology

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

Abstract

In this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min{n, 6 δ - 15}, thereby generalizing several known results.

Original language	English
Pages (from-to)	3580-3587
Number of pages	8
Journal	Discrete Mathematics
Volume	309
Issue number	11
DOIs	https://doi.org/10.1016/j.disc.2007.12.062
Publication status	Published - 6 Jun 2009

Keywords

3-connectedness
Circumference
Claw-free graph
Minimum degree

Access to Document

10.1016/j.disc.2007.12.062

Cite this

@article{52c435906d8a416a9f30add808d0c2a8,

title = "Circumferences and minimum degrees in 3-connected claw-free graphs",

abstract = "In this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min\{n, 6 δ - 15\}, thereby generalizing several known results.",

keywords = "3-connectedness, Circumference, Claw-free graph, Minimum degree",

author = "Li, \{Ming Chu\} and Yongrui Cui and Liming Xiong and Yuan Tian and He Jiang and Xu Yuan",

year = "2009",

month = jun,

day = "6",

doi = "10.1016/j.disc.2007.12.062",

language = "English",

volume = "309",

pages = "3580--3587",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "11",

}

TY - JOUR

T1 - Circumferences and minimum degrees in 3-connected claw-free graphs

AU - Li, Ming Chu

AU - Cui, Yongrui

AU - Xiong, Liming

AU - Tian, Yuan

AU - Jiang, He

AU - Yuan, Xu

PY - 2009/6/6

Y1 - 2009/6/6

N2 - In this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min{n, 6 δ - 15}, thereby generalizing several known results.

AB - In this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min{n, 6 δ - 15}, thereby generalizing several known results.

KW - 3-connectedness

KW - Circumference

KW - Claw-free graph

KW - Minimum degree

UR - https://www.scopus.com/pages/publications/67349192543

U2 - 10.1016/j.disc.2007.12.062

DO - 10.1016/j.disc.2007.12.062

M3 - Article

AN - SCOPUS:67349192543

SN - 0012-365X

VL - 309

SP - 3580

EP - 3587

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 11

ER -

Circumferences and minimum degrees in 3-connected claw-free graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this