The following pages link to Edge-colored saturated graphs (Q3822186):
Displaying 9 items.
- Saturation numbers for Ramsey-minimal graphs (Q1800401) (← links)
- On the size of \((K_t, K_{1, k})\)-co-critical graphs (Q2143402) (← links)
- On the size of \((K_t, P_k)\)-co-critical graphs (Q2163839) (← links)
- On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs (Q2223466) (← links)
- On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs (Q2231720) (← links)
- Linearity of saturation for Berge hypergraphs (Q2422222) (← links)
- Ramsey-minimal saturation numbers for matchings (Q2436829) (← links)
- Rainbow Saturation for Complete Graphs (Q6130540) (← links)
- The rainbow saturation number is linear (Q6490280) (← links)
