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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.03.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975608169 / rank
 
Normal rank
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