On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs (Q2978176)

From MaRDI portal
Revision as of 23:03, 5 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56926462, #quickstatements; #temporary_batch_1714942991822)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs
scientific article

    Statements

    title
    On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs (English)
    0 references
    DOI
    10.1002/jgt.22026
    0 references
    author
    Seongmin Ok
    0 references
    Carsten Thomassen
    0 references
    publication date
    21 April 2017
    0 references
    zbMATH DE Number
    6707225
    0 references
    zbMATH Keywords
    spanning tree
    0 references
    cubic graph
    0 references
    edge connectivity
    0 references
    OpenAlex ID
    W2302210904
    0 references
    Wikidata QID
    Q56926462
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2978176&oldid=34069729"
    Powered by MediaWiki