Pages that link to "Item:Q5928418"
From MaRDI portal
The following pages link to The number of maximum independent sets in graphs (Q5928418):
Displaying 48 items.
- Maximal independent sets in the covering graph of the cube (Q385145) (← links)
- Independent sets in graphs (Q501998) (← 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)
- Estimates of the number of independent sets in graphs with a fixed independence number (Q736194) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
- Graphs with the second largest number of maximal independent sets (Q998481) (← links)
- The number of independent sets in unicyclic graphs with a given diameter (Q1028107) (← links)
- Graphs with unique maximum independent sets (Q1069954) (← links)
- On unique independent sets in graphs (Q1331985) (← links)
- On the independence graph of a graph (Q1412670) (← 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)
- An extension of the Win theorem: counting the number of maximum independent sets (Q2002161) (← links)
- Trees with a given number of leaves and the maximal number of maximum independent sets (Q2031165) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- The number of maximal independent sets in trees with a given number of leaves (Q2127636) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- Graphs with unique maximum packing of closed neighborhoods (Q2151212) (← links)
- Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
- Maximal independent sets and maximal matchings in series-parallel and related graph classes (Q2288167) (← links)
- The number of independent sets in an irregular graph (Q2312617) (← links)
- A family of metrics for biopolymers based on counting independent sets (Q2490489) (← links)
- The number of independent sets in unicyclic graphs (Q2576351) (← links)
- Maximal independent sets in clique-free graphs (Q2674559) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Maximal independent sets in grid graphs (Q2968510) (← links)
- (Q3105531) (← links)
- (Q3328581) (← links)
- Maximal independent sets in graphs with at mostr cycles (Q3418194) (← links)
- Maximal and maximum independent sets in graphs with at mostr cycles (Q3418195) (← links)
- Constraints on the number of maximal independent sets in graphs (Q4284106) (← links)
- MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS (Q4294716) (← links)
- On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets (Q4558291) (← links)
- Maximal independent sets and maximal matchings in series-parallel and related graph classes (Q4993540) (← links)
- (Q5135778) (← links)
- (Q5397250) (← links)
- On the number of independent sets in graphs with fixed independence number (Q5439048) (← links)
- On the maximum number of maximum independent sets in connected graphs (Q6055407) (← links)
- Maximizing the number of independent sets of fixed size in Kn‐covered graphs (Q6056803) (← links)
- Counting maximal independent sets in some \(n\)-gonal cacti (Q6064859) (← links)
- Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← 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)