The game of F-saturator
From MaRDI portal
Publication:968127
DOI10.1016/J.DAM.2009.09.014zbMATH Open1226.05179OpenAlexW2053266684MaRDI QIDQ968127FDOQ968127
Authors: Michael Ferrara, Angela Harris, Michael 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
Recommendations
Cites Work
- The Factorization of Linear Graphs
- \(C_4\)-saturated bipartite graphs
- Saturated graphs with minimal number of edges
- A Problem in Graph Theory
- Minimum C5‐saturated graphs
- A note on minimum \(K_{2,3}\)-saturated graphs
- Title not available (Why is that?)
- Size in maximal triangle-free graphs and minimal graphs of diameter 2
- tK\(_p\)-saturated graphs of minimum size
- 1-Faktoren von Graphen. (1-factors of graphs)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Saturation numbers of books
- A game of edge removal on graphs
- P_m-saturated bipartite graphs with minimum size
- Constructive upper bounds for cycle-saturated graphs of minimum size
Cited In (9)
This page was built for publication: The game of \(\mathcal F\)-saturator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968127)