Pages that link to "Item:Q2225397"
From MaRDI portal
The following pages link to Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph (Q2225397):
Displaying 11 items.
- Asymptotic results on saturated graphs (Q1174171) (← links)
- Cycle-saturated graphs of minimum size (Q1916094) (← links)
- Saturation numbers for disjoint stars (Q2099391) (← links)
- The minimum number of clique-saturating edges (Q2680567) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Onk-saturated graphs with restrictions on the degrees (Q4892338) (← links)
- Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs (Q4992838) (← links)
- Weakly saturated hypergraphs and a conjecture of Tuza (Q5889737) (← links)
- Constructive upper bounds for cycle-saturated graphs of minimum size (Q5920622) (← links)
- Rainbow Saturation for Complete Graphs (Q6130540) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
