Game edge-connectivity of graphs

DOI10.1016/J.DAM.2021.04.005MaRDI QIDQ2028096zbMATH OpenOpenAlexFDO

Authors 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

game edge-connectivityShannon switching gamespanning tree

Mathematics Subject Classification ID

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

Recommendations

• Note on fair game edge-connectivity of graphs
• Game connectivity of graphs
• A connectivity game for graphs
• Domination game and minimal edge cuts
• Weak and strong \(k\)-connectivity games

Cites work

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

Cited in

(3)

• Game connectivity of graphs
• A connectivity game for graphs
• Note on fair game edge-connectivity of graphs

This page was built for publication: Game edge-connectivity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028096)