Saturation numbers for t P_k with k less than 6
From MaRDI portal
Publication:2104931
Recommendations
Cites work
- A Problem in Graph Theory
- A survey of minimum saturated graphs
- Results and problems on saturation numbers for linear forests
- Saturated graphs with minimal number of edges
- The Turán number of disjoint copies of paths
- Turán numbers for disjoint copies of graphs
- Turán numbers of multiple paths and equibipartite forests
Cited in
(17)- Saturation numbers for disjoint stars
- Minimum \(t P_3\)-saturation graphs
- Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
- Saturation numbers for families of graph subdivisions
- Weak saturation number of a complete bipartite graph
- Some results on the saturation number for unions of cliques
- On fan-saturated graphs
- Linear saturation numbers of Berge-C₃ and Berge-C₄
- Some results on minimum saturated graphs
- Some results on the saturation number of graphs
- Minimum saturated graphs for unions of cliques
- The minimum spectral radius of tP₃- or K₅-saturated graphs via the number of 2-walks
- (K₁ P_t)-saturated graphs with minimum number of edges
- The saturation number of W₄
- Saturation numbers of balanced double stars
- Saturation numbers for linear forests P₅ P₄ tP₂
- Saturation numbers of K₂ P_k
This page was built for publication: Saturation numbers for \(t P_k\) with \(k\) less than 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104931)