Spanning trees whose stems have a bounded number of branch vertices (Q726654): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Neighborhood unions and extremal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning spiders and light-splitting switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3466235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with a bounded number of branch vertices in a claw-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4982929 / rank
 
Normal rank

Latest revision as of 07:53, 12 July 2024

scientific article
Language Label Description Also known as
English
Spanning trees whose stems have a bounded number of branch vertices
scientific article

    Statements

    Spanning trees whose stems have a bounded number of branch vertices (English)
    0 references
    0 references
    13 July 2016
    0 references
    spanning tree
    0 references
    stem
    0 references
    branch vertex
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references