The longest cycles in a graph G with minimum degree at least \(| G| /k\)
type: Item
instance of: scholarly article
title: The longest cycles in a graph G with minimum degree at least \(| G| /k\)
zbMATH Open document ID: 0669.05043
DOI: 10.1016/0095-8956(89)90055-5
author: Takashi Miyamoto
author: Yoshimi Egawa
published in: Journal of Combinatorial Theory. Series B
publication date: 1989-01-01T00:00:00Z
review text: This article shows that if \(d_ G(x)+d_ G(y)\geq \lceil 2| V(G)| /k\rceil\) for any nonadjacent distinct vertices x and y of V(G), then G has a cycle of length at least \(\lceil | V(G)| /(k- 1)\rceil\).
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 4095503
zbMATH Keywords: circumference
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: 0095-8956(89)90055-5
OpenAlex ID: W2023290792
cites work: The longest cycle of a graph with a large minimal degree
cites work: Q4094891
cites work: Q3818315
cites work: Q3880849
description: scientific article; zbMATH DE number 4095503