A generalization of Dirac's theorem (Q1065022): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3963042 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long paths and large cycles in finite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long cycles generate the cycle space of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3710546 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A basis for the cycle space of a 2-connected graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4192093 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4141844 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02579378 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084074102 / rank | |||
Normal rank |
Latest revision as of 08:47, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A generalization of Dirac's theorem |
scientific article |
Statements
A generalization of Dirac's theorem (English)
0 references
1985
0 references
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.
0 references
cycle
0 references