Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609)

From MaRDI portal
Revision as of 20:06, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Edge-disjoint spanning trees and the number of maximum state circles of a graph
scientific article

    Statements

    Edge-disjoint spanning trees and the number of maximum state circles of a graph (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    spanning trees
    0 references
    polynomial-time algorithm
    0 references
    state circle
    0 references
    link
    0 references

    Identifiers