Pages that link to "Item:Q6055407"
From MaRDI portal
The following pages link to On the maximum number of maximum independent sets in connected graphs (Q6055407):
Displaying 20 items.
- On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (Q389981) (← links)
- Connected graphs with a large number of independent sets (Q395637) (← links)
- On the maximal independence polynomial of certain graph configurations (Q680338) (← links)
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs (Q709325) (← links)
- On the third largest number of maximal independent sets of graphs (Q726518) (← links)
- The number of maximal independent sets in a connected graph (Q1106856) (← links)
- Extremal connected graphs for independent domination number (Q1420609) (← links)
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number (Q1684927) (← links)
- On the maximum number of maximum independent sets (Q1756132) (← links)
- The second largest number of maximal independent sets in connected graphs with at most one cycle (Q1928530) (← links)
- Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- (Q3070898) (← links)
- (Q3328581) (← links)
- Maximizing the number of independent sets of fixed size in Kn‐covered graphs (Q6056803) (← 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)
