Forbidden subgraphs and the existence of a spanning tree without small degree stems (Q390302): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graphs with homeomorphically irreducible spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes characterized both by forbidden subgraphs and degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing forbidden pairs for hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pair of forbidden subgraphs and perfect matchings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden triples and traceability: A characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden induced subgraphs for perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2828975 / rank
 
Normal rank

Latest revision as of 07:03, 7 July 2024

scientific article
Language Label Description Also known as
English
Forbidden subgraphs and the existence of a spanning tree without small degree stems
scientific article

    Statements

    Forbidden subgraphs and the existence of a spanning tree without small degree stems (English)
    0 references
    0 references
    0 references
    23 January 2014
    0 references
    0 references
    \([2
    0 references
    k]\)-spanning tree (\([2
    0 references
    k]\)-ST)
    0 references
    homeomorphically irreducible spanning tree (HIST)
    0 references
    HIST-extendability
    0 references
    forbidden subgraph
    0 references
    0 references