The game of F-saturator
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- scientific article; zbMATH DE number 3900800 (Why is no real title available?)
- scientific article; zbMATH DE number 2192110 (Why is no real title available?)
- 1-Faktoren von Graphen. (1-factors of graphs)
- A Problem in Graph Theory
- A game of edge removal on graphs
- A note on minimum \(K_{2,3}\)-saturated graphs
- Constructive upper bounds for cycle-saturated graphs of minimum size
- Minimum C5‐saturated graphs
- P_m-saturated bipartite graphs with minimum size
- Saturated graphs with minimal number of edges
- Saturation numbers of books
- Size in maximal triangle-free graphs and minimal graphs of diameter 2
- The Factorization of Linear Graphs
- C₄-saturated bipartite graphs
- tK\(_p\)-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)