Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:57, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs |
scientific article |
Statements
Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (English)
0 references
21 April 2023
0 references
spanning tree
0 references
leaf
0 references
independence number
0 references
\(K_{1,r}\)-free
0 references
