Spanning k-ended trees of 3-regular connected graphs (Q5006619): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence trees and Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs. Proof techniques in factor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding spanning trees with few leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Las Vergnas concerning certain spanning trees in graphs / rank
 
Normal rank

Revision as of 10:38, 26 July 2024

scientific article; zbMATH DE number 7382301
Language Label Description Also known as
English
Spanning k-ended trees of 3-regular connected graphs
scientific article; zbMATH DE number 7382301

    Statements

    Spanning k-ended trees of 3-regular connected graphs (English)
    0 references
    0 references
    0 references
    16 August 2021
    0 references
    spanning tree
    0 references
    \(k\)-ended tree
    0 references
    leaf
    0 references
    3-regular graph
    0 references
    connected graph
    0 references

    Identifiers