Pages that link to "Item:Q1756132"
From MaRDI portal
The following pages link to On the maximum number of maximum independent sets (Q1756132):
Displaying 21 items.
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- Random maximal independent sets and the unfriendly theater seating arrangement problem (Q1044988) (← links)
- On the number of maximum intervals (Q1079541) (← links)
- The maximum number of balancing sets (Q1092046) (← links)
- On generating all maximal independent sets (Q1108809) (← links)
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number (Q1684927) (← links)
- An extension of the Win theorem: counting the number of maximum independent sets (Q2002161) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- Counting maximal antichains and independent sets (Q2376906) (← links)
- The max quasi-independent set Problem (Q3569731) (← links)
- The structure and maximum number of maximum independent sets in trees (Q3978364) (← links)
- (Q4252414) (← links)
- Lower Bounds for Maximal Matchings and Maximal Independent Sets (Q5056427) (← links)
- The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
- On the maximum number of maximum independent sets in connected graphs (Q6055407) (← links)
- On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza (Q6094038) (← links)
- Maximum dissociation sets in subcubic trees (Q6176408) (← links)
- On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number (Q6178795) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
- On the maximum number of maximum independent sets of bipartite graphs (Q6566705) (← links)