Spanning trees whose reducible stems have a few branch vertices (Q4959538): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Independence trees and Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with few peripheral branch vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3466235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees whose stems are spiders / 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 at most \(k\) leaves in \(K_{1,4}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for graphs to have spanning trees with few branch vertices and leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4982929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Las Vergnas concerning certain spanning trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees whose stems have a bounded number of branch vertices / rank
 
Normal rank

Latest revision as of 14:56, 26 July 2024

scientific article; zbMATH DE number 7396192
Language Label Description Also known as
English
Spanning trees whose reducible stems have a few branch vertices
scientific article; zbMATH DE number 7396192

    Statements

    Spanning trees whose reducible stems have a few branch vertices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2021
    0 references
    spanning tree
    0 references
    independence number
    0 references
    degree sum
    0 references
    reducible stem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references