Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs (Q1045112): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4350166 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Neighborhood unions and extremal spanning trees / rank | |||
Normal rank | |||
Latest revision as of 07:55, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs |
scientific article |
Statements
Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs (English)
0 references
15 December 2009
0 references
spanning tree
0 references
leaf
0 references
degree sum
0 references
\(K_{1,4}\)-free
0 references
