Game connectivity of graphs

DOI10.1016/j.disc.2020.112104zbMath1447.05138OpenAlexW3048904510MaRDI QIDQ2198411

Tomoki Nakamigawa, Naoki Matsumoto

Publication date: 10 September 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112104

zbMATH Keywords

connectivityedge-minimal graphgame connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On the complexity of some two-person perfect-information games
• Dynamic coloring parameters for graphs with given genus
• Game edge-connectivity of graphs
• Domination Game and an Imagination Strategy
• Finding all minimum-size separating vertex sets in a graph
• ON THE COMPLEXITY OF SOME COLORING GAMES
• An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
• Network Flow and Testing Graph Connectivity
• A New Game Invariant of Graphs: the Game Distinguishing Number