Pages that link to "Item:Q1168336"
From MaRDI portal
The following pages link to Disjoint cliques and disjoint maximal independent sets of vertices in graphs (Q1168336):
Displaying 9 items.
- On disjoint maximal independent sets in graphs (Q458376) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- Graph partition into small cliques (Q741755) (← links)
- On graph fall-coloring: existence and constructions (Q2287754) (← links)
- 1-well-covered graphs revisited (Q2311371) (← links)
- Edge-Disjoint Cliques in Graphs with High Minimum Degree (Q3192169) (← links)
- The disjoint cliques problem (Q4345417) (← links)
- Disjoint dominating sets with a perfect matching (Q4595255) (← links)
- On graphs admitting two disjoint maximum independent sets (Q5058163) (← links)