Maximizing spanning trees in almost complete graphs (Q4355482): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Maximizing spanning trees in almost complete graphs | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199708)30:1<23::aid-net3>3.0.co;2-n / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089018301 / rank | |||
Normal rank | |||
| Property / title | |||
Maximizing spanning trees in almost complete graphs (English) | |||
| Property / title: Maximizing spanning trees in almost complete graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 10:53, 30 July 2024
scientific article; zbMATH DE number 1063795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing spanning trees in almost complete graphs |
scientific article; zbMATH DE number 1063795 |
Statements
21 September 1997
0 references
finite graphs
0 references
paths
0 references
cycles
0 references
characterization
0 references
spanning trees
0 references
Maximizing spanning trees in almost complete graphs (English)
0 references
