Pages that link to "Item:Q1981694"
From MaRDI portal
The following pages link to Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs (Q1981694):
Displaying 6 items.
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph (Q2225397) (← 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)
- Constructive upper bounds for cycle-saturated graphs of minimum size (Q5920622) (← links)
- Saturation for the 3-uniform loose 3-cycle (Q6091820) (← links)
- On the saturation spectrum of families of cycle subdivisions (Q6159028) (← links)
