Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (Q3393426): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users 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.1137/060664318 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020354668 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:29, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning Trees with Many Leaves in Graphs With Minimum Degree Three |
scientific article |
Statements
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (English)
0 references
20 August 2009
0 references
spanning tree
0 references
Max leaf
0 references
connected dominating set
0 references
extremal graph theory
0 references
