Non-separating trees in connected graphs (Q1045001): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4405778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-separating induced cycles in graphs / rank
 
Normal rank

Latest revision as of 07:52, 2 July 2024

scientific article
Language Label Description Also known as
English
Non-separating trees in connected graphs
scientific article

    Statements

    Non-separating trees in connected graphs (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    non-separating tree
    0 references
    isomorphic subtree
    0 references
    minimum degree
    0 references
    0 references