Partite saturation number of cycles
From MaRDI portal
Cites work
- \(K_{s,t}\)-saturated bipartite graphs
- A Problem in Graph Theory
- A survey of minimum saturated graphs
- All minimum \(C_{5}\)-saturated graphs
- Constructive upper bounds for cycle-saturated graphs of minimum size
- Cycle-saturated graphs with minimum number of edges
- Exact bounds for some hypergraph saturation problems
- Graph saturation in multipartite graphs
- scientific article; zbMATH DE number 1156652 (Why is no real title available?)
- scientific article; zbMATH DE number 1409250 (Why is no real title available?)
- scientific article; zbMATH DE number 3239217 (Why is no real title available?)
- scientific article; zbMATH DE number 3414346 (Why is no real title available?)
- scientific article; zbMATH DE number 4185643 (Why is no real title available?)
- Minimizing the number of edges in \(K_{(s,t)}\)-saturated bipartite graphs
- Minimum C5‐saturated graphs
- On a Conjecture of Erdos, Hajnal and Moon
- On the number of edges in a minimum \(C_6\)-saturated graph
- P_m-saturated bipartite graphs with minimum size
- Partite saturation of complete graphs
- Partite saturation problems
- Saturated graphs with minimal number of edges
- Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
- Saturation numbers in tripartite graphs
- The saturation number of C₆
This page was built for publication: Partite saturation number of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883710)
