A sharp lower bound for the circumference of 1‐tough graphs with large degree sums (Q4852400): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190200204 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005944318 / rank | |||
Normal rank | |||
Latest revision as of 02:36, 20 March 2024
scientific article; zbMATH DE number 811249
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp lower bound for the circumference of 1‐tough graphs with large degree sums |
scientific article; zbMATH DE number 811249 |
Statements
A sharp lower bound for the circumference of 1‐tough graphs with large degree sums (English)
0 references
31 October 1995
0 references
lower bound
0 references
dominating cycle
0 references
longest cycle
0 references
1-tough graph
0 references
degree sum
0 references
independent set
0 references
hamiltonian cycles
0 references
