Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

Ming Chu Li; Liming Xiong

doi:10.1016/j.endm.2005.06.017

Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

Ming Chu Li^*, Liming Xiong

^*Corresponding author for this work

School of Mathematics and Statistics

Dalian University of Technology

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

Abstract

In this paper, we prove that every 3-connected claw-free graph on n vertices contain a cycle of length at least min {n, 6 δ - 17}, hereby improving several known results.

Original language	English
Pages (from-to)	93-99
Number of pages	7
Journal	Electronic Notes in Discrete Mathematics
Volume	22
DOIs	https://doi.org/10.1016/j.endm.2005.06.017
Publication status	Published - 15 Oct 2005

Keywords

Circumference
claw-free graph
longest cycle

Access to Document

10.1016/j.endm.2005.06.017

Cite this

@article{8afce6139d874946a99ac7ed59eb4e7e,

title = "Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs",

abstract = "In this paper, we prove that every 3-connected claw-free graph on n vertices contain a cycle of length at least min {n, 6 δ - 17}, hereby improving several known results.",

keywords = "Circumference, claw-free graph, longest cycle",

author = "Li, {Ming Chu} and Liming Xiong",

year = "2005",

month = oct,

day = "15",

doi = "10.1016/j.endm.2005.06.017",

language = "English",

volume = "22",

pages = "93--99",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

}

TY - JOUR

T1 - Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

AU - Li, Ming Chu

AU - Xiong, Liming

PY - 2005/10/15

Y1 - 2005/10/15

N2 - In this paper, we prove that every 3-connected claw-free graph on n vertices contain a cycle of length at least min {n, 6 δ - 17}, hereby improving several known results.

AB - In this paper, we prove that every 3-connected claw-free graph on n vertices contain a cycle of length at least min {n, 6 δ - 17}, hereby improving several known results.

KW - Circumference

KW - claw-free graph

KW - longest cycle

UR - http://www.scopus.com/inward/record.url?scp=34247126106&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2005.06.017

DO - 10.1016/j.endm.2005.06.017

M3 - Article

AN - SCOPUS:34247126106

SN - 1571-0653

VL - 22

SP - 93

EP - 99

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this