Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2023.127842 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2023.127842 / rank | |||
Normal rank | |||
Latest revision as of 20:25, 19 December 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
