Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\) (Q1169481): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:59, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\) |
scientific article |
Statements
Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\) (English)
0 references
1982
0 references
Ore-condition
0 references
Hamilton cycle
0 references
