Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Guantao Chen / rank
 
Normal rank
Property / author
 
Property / author: Zhi-quan Hu / rank
 
Normal rank

Revision as of 06:30, 11 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
    0 references
    0 references
    0 references
    0 references
    21 April 2023
    0 references
    spanning tree
    0 references
    leaf
    0 references
    independence number
    0 references
    \(K_{1,r}\)-free
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references