Game edge-connectivity of graphs (Q2028096): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Construction and enumeration of regular maps on the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The switching game on unions of oriented matroids / 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: A Combinatorial Problem Which Is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed switching games on graphs and matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to the Box Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hex and combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle games and cycle cut games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithm for finding all minimal edge cuts of a nonoriented graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solution of the Shannon Switching Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees / 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
Property / cites work
 
Property / cites work: Connectivity of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shannon-like games are difficult / rank
 
Normal rank

Latest revision as of 20:15, 25 July 2024

scientific article
Language Label Description Also known as
English
Game edge-connectivity of graphs
scientific article

    Statements

    Game edge-connectivity of graphs (English)
    0 references
    0 references
    0 references
    31 May 2021
    0 references
    game edge-connectivity
    0 references
    spanning tree
    0 references
    Shannon switching game
    0 references

    Identifiers