Degree Conditions for Spanning Brooms (Q2930040): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Some Theorems on Abstract Graphs / rank
 
Normal rank
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: Q4862113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank

Latest revision as of 07:00, 9 July 2024

scientific article
Language Label Description Also known as
English
Degree Conditions for Spanning Brooms
scientific article

    Statements

    Degree Conditions for Spanning Brooms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2014
    0 references
    spanning spider
    0 references
    spanning tree
    0 references
    neighborhood union
    0 references
    Hamilton path
    0 references
    traceable graph
    0 references

    Identifiers