The game of \(\mathcal F\)-saturator

DOI10.1016/j.dam.2009.09.014zbMath1226.05179OpenAlexW2053266684MaRDI QIDQ968127

Angela Harris, Michael Ferrara, Michael S. Jacobson

Publication date: 5 May 2010

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

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

zbMATH Keywords

saturated graphcombinatorial game

Mathematics Subject Classification ID

Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Game saturation of intersecting families ⋮ The Game Saturation Number of a Graph

Cites Work

• Saturation numbers of books
• tK\(_p\)-saturated graphs of minimum size
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• \(C_4\)-saturated bipartite graphs
• 1-Faktoren von Graphen. (1-factors of graphs)
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• P_m-saturated bipartite graphs with minimum size
• A Problem in Graph Theory
• The Factorization of Linear Graphs
• Constructive upper bounds for cycle-saturated graphs of minimum size
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The game of \(\mathcal F\)-saturator