Long cycles in 3-cyclable graphs

D. Bauer; L. Mcguire; H. Trommel; H.J. Veldman

doi:10.1016/S0012-365X(99)00331-3

Long cycles in 3-cyclable graphs

D. Bauer, L. Mcguire, H. Trommel, H.J. Veldman

Discrete Mathematics and Mathematical Programming

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

1 Citation (Scopus)

96 Downloads (Pure)

Abstract

It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α, then G contains a cycle of length at least min {n,3δ−3,n+δ−α}.

Original language	English
Number of pages	8
Journal	Discrete mathematics
Volume	218
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(99)00331-3
Publication status	Published - May 2000

Keywords

Graph
Long cycle
METIS-141257
(Hamilton) cycle
3-cyclable
IR-74264

Access to Document

10.1016/S0012-365X(99)00331-3Licence: Other

Bauer00longFinal published version, 77.9 KBLicence: Other

Cite this

@article{dd1e32feb8f14c60bafb1c69ae01192d,

title = "Long cycles in 3-cyclable graphs",

abstract = "It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α, then G contains a cycle of length at least min {n,3δ−3,n+δ−α}.",

keywords = "Graph, Long cycle, METIS-141257, (Hamilton) cycle, 3-cyclable, IR-74264",

author = "D. Bauer and L. Mcguire and H. Trommel and H.J. Veldman",

note = "Memorandum Faculteit TW, nr 1434 ",

year = "2000",

month = may,

doi = "10.1016/S0012-365X(99)00331-3",

language = "English",

volume = "218",

journal = "Discrete mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Long cycles in 3-cyclable graphs

AU - Bauer, D.

AU - Mcguire, L.

AU - Trommel, H.

AU - Veldman, H.J.

N1 - Memorandum Faculteit TW, nr 1434

PY - 2000/5

Y1 - 2000/5

N2 - It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α, then G contains a cycle of length at least min {n,3δ−3,n+δ−α}.

AB - It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α, then G contains a cycle of length at least min {n,3δ−3,n+δ−α}.

KW - Graph

KW - Long cycle

KW - METIS-141257

KW - (Hamilton) cycle

KW - 3-cyclable

KW - IR-74264

U2 - 10.1016/S0012-365X(99)00331-3

DO - 10.1016/S0012-365X(99)00331-3

M3 - Article

VL - 218

JO - Discrete mathematics

JF - Discrete mathematics

SN - 0012-365X

IS - 1-3

ER -

Long cycles in 3-cyclable graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this