A generalization of Dirac's theorem
type: Item
instance of: scholarly article
title: A generalization of Dirac's theorem
zbMATH Open document ID: 0576.05034
DOI: 10.1007/BF02579378
published in: Combinatorica
publication date: 1985-01-01T00:00:00Z
review text: An \((r+2)\)-connected graph G, which the degree of every vertex is at least d and which has at least 2d-r vertices contains a cycle of length at least 2d-r.
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3920508
zbMATH Keywords: cycle
author: S. C. Locke
reviewed by: Stefan Mititelu
MaRDI profile type: Publication
cites work: Q3963042
cites work: Q3097395
cites work: Some Theorems on Abstract Graphs
cites work: Long paths and large cycles in finite graphs
cites work: On maximal paths and circuits of graphs
cites work: Long cycles generate the cycle space of a graph
cites work: Q3710546
cites work: A basis for the cycle space of a 2-connected graph
cites work: Q3880849
cites work: Q4192093
cites work: Q4141844
full work available at URL: https://doi.org/10.1007/bf02579378
OpenAlex ID: W2084074102
description: scientific article; zbMATH DE number 3920508