Cycles and paths through specified vertices in k-connected graphs (Q1116957): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relative lengths of paths and cycles in k-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalization of Dirac's theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycles through three vertices in 2-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Applications of Menger's graph theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Long cycles through specified vertices in a graph / rank | |||
Normal rank | |||
Latest revision as of 13:19, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycles and paths through specified vertices in k-connected graphs |
scientific article |
Statements
Cycles and paths through specified vertices in k-connected graphs (English)
0 references
1991
0 references
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.
0 references
longest cycle
0 references
Dirac's theorem
0 references
minimum degree
0 references
cycle
0 references
paths
0 references
