Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398)

From MaRDI portal
Revision as of 18:42, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Counting Spanning Trees in Graphs Using Modular Decomposition
scientific article

    Statements

    title
    Counting Spanning Trees in Graphs Using Modular Decomposition (English)
    0 references
    author
    Leonidas Palios
    0 references
    Charis Papadopoulos
    0 references
    publication date
    20 February 2011
    0 references
    cites work
    Q4091421
    0 references
    Algebraic Graph Theory
    0 references
    Computer Science Logic
    0 references
    Q3836509
    0 references
    Q4298260
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C05
    0 references
    05C30
    0 references
    zbMATH DE Number
    5853615
    0 references
    OpenAlex ID
    W1561600188
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3078398&oldid=35215112"
    Powered by MediaWiki