The following pages link to Nearly perfect sets in graphs (Q1842165):
Displaying 12 items.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Near perfect coverings in graphs and hypergraphs (Q1092067) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- A note on matching-cut in \(P_t\)-free graphs (Q2094374) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- Proper nearly perfect sets in graphs. (Q2828987) (← links)
- Equitable fair domination in graphs (Q5025163) (← links)
- A Taxonomy of Perfect Domination (Q5069690) (← links)
- 1-Triangle graphs and perfect neighborhood sets (Q5269160) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)
- Outer complete fair domination in graphs (Q5866027) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)