Pages that link to "Item:Q1684927"

The following pages link to Maximizing the number of independent sets of fixed size in connected graphs with given independence number (Q1684927):

Displaying 9 items.

• A simple proof that finding a maximal independent set in a graph is in NC (Q834937) (← links)
• Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704) (← links)
• MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS (Q4294716) (← links)
• The number of independent sets in a connected graph and its complement (Q5198015) (← 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)
• On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number (Q6178795) (← links)
• On the maximum number of maximum independent sets of bipartite graphs (Q6566705) (← links)