Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (Q641183)

From MaRDI portal
Revision as of 14:10, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
scientific article

    Statements

    Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (English)
    0 references
    0 references
    21 October 2011
    0 references
    0 references
    spanning tree
    0 references
    leaf
    0 references
    degree sum
    0 references
    \(K_{1, 4}\)-free
    0 references
    spanning \(t\)-ended system
    0 references
    0 references