A condition ensuring that a connected graph has a spanning tree with few leaves (Q2699565)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A condition ensuring that a connected graph has a spanning tree with few leaves |
scientific article |
Statements
A condition ensuring that a connected graph has a spanning tree with few leaves (English)
0 references
19 April 2023
0 references
spanning tree
0 references
leaves
0 references
\(k\)-frame
0 references
