Long D3-cycles in graphs with large minimum degree

H. Trommel

Research output: Book/ReportReportProfessional

6 Downloads (Pure)

Abstract

It is shown that if G is a 2-connected graph on n vertices, with minimum degree such that n≤4δ−6, and with a maximum independent set of cardinality , then G contains a cycle of length at least min {n,n+2δ−2α−2g or G ε F, where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversiteit Twente
Number of pages11
ISBN (Print)0169-2690
Publication statusPublished - 1997

Publication series

NameMemorandum / University of Twente, Faculty of Applied Mathematics
PublisherUniversiteit Twente
No.1368

Keywords

  • METIS-141165
  • IR-30525

Cite this

Trommel, H. (1997). Long D3-cycles in graphs with large minimum degree. (Memorandum / University of Twente, Faculty of Applied Mathematics; No. 1368). Enschede: Universiteit Twente.
Trommel, H. / Long D3-cycles in graphs with large minimum degree. Enschede : Universiteit Twente, 1997. 11 p. (Memorandum / University of Twente, Faculty of Applied Mathematics; 1368).
@book{c5c51169a94b44dcb2b0473c2f4eee7d,
title = "Long D3-cycles in graphs with large minimum degree",
abstract = "It is shown that if G is a 2-connected graph on n vertices, with minimum degree such that n≤4δ−6, and with a maximum independent set of cardinality , then G contains a cycle of length at least min {n,n+2δ−2α−2g or G ε F, where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.",
keywords = "METIS-141165, IR-30525",
author = "H. Trommel",
note = "Memorandum fac. TW nr 1368",
year = "1997",
language = "Undefined",
isbn = "0169-2690",
series = "Memorandum / University of Twente, Faculty of Applied Mathematics",
publisher = "Universiteit Twente",
number = "1368",

}

Trommel, H 1997, Long D3-cycles in graphs with large minimum degree. Memorandum / University of Twente, Faculty of Applied Mathematics, no. 1368, Universiteit Twente, Enschede.

Long D3-cycles in graphs with large minimum degree. / Trommel, H.

Enschede : Universiteit Twente, 1997. 11 p. (Memorandum / University of Twente, Faculty of Applied Mathematics; No. 1368).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Long D3-cycles in graphs with large minimum degree

AU - Trommel, H.

N1 - Memorandum fac. TW nr 1368

PY - 1997

Y1 - 1997

N2 - It is shown that if G is a 2-connected graph on n vertices, with minimum degree such that n≤4δ−6, and with a maximum independent set of cardinality , then G contains a cycle of length at least min {n,n+2δ−2α−2g or G ε F, where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.

AB - It is shown that if G is a 2-connected graph on n vertices, with minimum degree such that n≤4δ−6, and with a maximum independent set of cardinality , then G contains a cycle of length at least min {n,n+2δ−2α−2g or G ε F, where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.

KW - METIS-141165

KW - IR-30525

M3 - Report

SN - 0169-2690

T3 - Memorandum / University of Twente, Faculty of Applied Mathematics

BT - Long D3-cycles in graphs with large minimum degree

PB - Universiteit Twente

CY - Enschede

ER -

Trommel H. Long D3-cycles in graphs with large minimum degree. Enschede: Universiteit Twente, 1997. 11 p. (Memorandum / University of Twente, Faculty of Applied Mathematics; 1368).