Toughness and Vertex Degrees (Q4908831): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0912.2919 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Realizability and uniqueness in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The strongest monotone degree condition for \(n\)-connectedness of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5576241 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Hamilton's ideals / rank | |||
Normal rank | |||
Latest revision as of 06:51, 6 July 2024
scientific article; zbMATH DE number 6142492
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toughness and Vertex Degrees |
scientific article; zbMATH DE number 6142492 |
Statements
Toughness and Vertex Degrees (English)
0 references
7 March 2013
0 references
degree sequences
0 references
toughness
0 references
best monotone theorem
0 references
