A sharp lower bound for the circumference of 1‐tough graphs with large degree sums (Q4852400): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:33, 8 February 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
