On saturation games

DOI10.1016/J.EJC.2015.05.017zbMath1321.05158arXiv1406.2111OpenAlexW1658226621MaRDI QIDQ499485

Alon Naor, Miloš Stojaković, Dan Hefetz, Michael Krivelevich

Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2111

zbMATH Keywords

saturation number

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Graph saturation games ⋮ Linear bounds for cycle-free saturation games ⋮ Spanning-Tree Games. ⋮ Unnamed Item ⋮ Saturation games for odd cycles ⋮ The Game Saturation Number of a Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of minimum saturated graphs
• Arc coverings of graphs
• An upper bound on the extremal version of Hajnal's triangle-free game
• Game saturation of intersecting families
• Game matching number of graphs
• 1-Faktoren von Graphen. (1-factors of graphs)
• Saturated graphs with minimal number of edges
• The Game Saturation Number of a Graph
• A Problem in Graph Theory
• The Factorization of Linear Graphs

This page was built for publication: On saturation games