The rainbow saturation number is linear
From MaRDI portal
Publication:6490280
Recommendations
Cites work
- scientific article; zbMATH DE number 4081590 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 2192110 (Why is no real title available?)
- scientific article; zbMATH DE number 3275275 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- A Problem in Graph Theory
- A survey of minimum saturated graphs
- An extremal problem for sets with applications to graph theory
- Asymptotic results on saturated graphs
- Colored saturation parameters for rainbow subgraphs
- Edge-colored saturated graphs
- On edge-colored saturation problems
- Rainbow saturation
- Rainbow saturation and graph capacities
- Rainbow saturation of graphs
- Saturated graphs with minimal number of edges
- Weakly saturated hypergraphs and a conjecture of Tuza
This page was built for publication: The rainbow saturation number is linear
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490280)