Saturation numbers of joins of graphs
From MaRDI portal
Publication:6611030
DOI10.1016/j.dam.2024.06.024zbMATH Open1547.05143MaRDI QIDQ6611030
Yuejian Peng, Zhidan Luo, Sinan Hu
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of minimum saturated graphs
- Weak saturation numbers for multiple copies
- Saturation numbers of books
- tK\(_p\)-saturated graphs of minimum size
- Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
- Weak saturation numbers of complete bipartite graphs in the clique
- Saturation numbers for nearly complete graphs
- 1-Faktoren von Graphen. (1-factors of graphs)
- All minimum C5-saturated graphs
- Minimum C5‐saturated graphs
- Saturated graphs with minimal number of edges
- A Problem in Graph Theory
- Weak saturation numbers for sparse graphs
This page was built for publication: Saturation numbers of joins of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611030)
