The following pages link to Minimum \(C_k\)-saturated graphs (Q2857396):
Displaying 18 items.
- tK\(_p\)-saturated graphs of minimum size (Q1045128) (← links)
- Cycle-saturated graphs of minimum size (Q1916094) (← links)
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs (Q1981694) (← links)
- Minimum \(t P_3\)-saturation graphs (Q2112662) (← links)
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph (Q2225397) (← links)
- Minimum clique-free subgraphs of Kneser graphs (Q2243816) (← links)
- \(C_{2k}\)-saturated graphs with no short odd cycles (Q2334067) (← links)
- On the number of edges in a minimum \(C_6\)-saturated graph (Q2354620) (← links)
- \(C_{3}\) saturated graphs (Q2566152) (← links)
- Minimum \((n,k,t)\) clique graphs (Q2799814) (← links)
- All minimum C5-saturated graphs (Q2998920) (← links)
- Minimum <i>C</i><sub>5</sub>‐saturated graphs (Q3633000) (← links)
- Min-max and max-min graph saturation parameters (Q4956200) (← links)
- Minimum<i>K</i><sub>2, 3</sub>-Saturated Graphs (Q5495889) (← links)
- (Q5750884) (← links)
- Weakly saturated hypergraphs and a conjecture of Tuza (Q5889737) (← links)
- Constructive upper bounds for cycle-saturated graphs of minimum size (Q5896826) (← links)
- Constructive upper bounds for cycle-saturated graphs of minimum size (Q5920622) (← links)
