Game edge-connectivity of graphs

DOI10.1016/j.dam.2021.04.005zbMath1465.05114OpenAlexW3159645113MaRDI QIDQ2028096

Naoki Matsumoto, Tomoki Nakamigawa

Publication date: 31 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.04.005

zbMATH Keywords

spanning treeShannon switching gamegame edge-connectivity

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Game connectivity of graphs, Note on fair game edge-connectivity of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The switching game on unions of oriented matroids
• Spanning trees: A survey
• Shannon-like games are difficult
• Connectivity of Cartesian product graphs
• Edge-connectivity and edge-disjoint spanning trees
• Cycle games and cycle cut games
• Directed switching games on graphs and matroids
• A solution to the Box Game
• Game connectivity of graphs
• Hex and combinatorics
• Construction and enumeration of regular maps on the torus
• Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• A Combinatorial Problem Which Is Complete in Polynomial Space
• A Solution of the Shannon Switching Game