Cycles and paths through specified vertices in k-connected graphs
type: Item
instance of: scholarly article
title: Cycles and paths through specified vertices in k-connected graphs
zbMATH Open document ID: 0666.05044
DOI: 10.1016/0095-8956(91)90086-Y
author: R. Glas
author: S. C. Locke
author: Yoshimi Egawa
published in: Journal of Combinatorial Theory. Series B
publication date: 1991-01-01T00:00:00Z
review text: Let G be a k-connected graph with minimum degree d and at least 2d vertices. Then G has a cycle of length at least 2d through any specified set of k vertices. A similar result for paths is also given.
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4089588
zbMATH Keywords: longest cycle
zbMATH Keywords: Dirac's theorem
zbMATH Keywords: minimum degree
zbMATH Keywords: cycle
zbMATH Keywords: paths
MaRDI profile type: Publication
cites work: Some Theorems on Abstract Graphs
cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
cites work: Relative lengths of paths and cycles in k-connected graphs
cites work: A generalization of Dirac's theorem
cites work: Cycles through three vertices in 2-connected graphs
cites work: Applications of Menger's graph theorem
cites work: Long cycles through specified vertices in a graph
description: scientific article; zbMATH DE number 4089588