Connectivity and edge-disjoint spanning trees (Q1837196): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint branching in directed multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph homeomorphism problem / rank
 
Normal rank

Latest revision as of 17:16, 13 June 2024

scientific article
Language Label Description Also known as
English
Connectivity and edge-disjoint spanning trees
scientific article

    Statements

    Connectivity and edge-disjoint spanning trees (English)
    0 references
    0 references
    1983
    0 references
    maximum number of edge-disjoint spanning trees
    0 references
    edge connectivity
    0 references

    Identifiers