Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (Q3393426): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:15, 4 February 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
