On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs (Q2573645): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5593828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected rigidity matroids and unique realizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generic Rigidity in the Plane / 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: Q3330973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank

Latest revision as of 12:18, 11 June 2024

scientific article
Language Label Description Also known as
English
On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
scientific article

    Statements

    On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs (English)
    0 references
    0 references
    22 November 2005
    0 references
    Connectivity of graphs
    0 references
    2-connected orientation
    0 references
    Rigidity matroid
    0 references

    Identifiers