Pages that link to "Item:Q5439059"
From MaRDI portal
The following pages link to An upper bound for the number of maximal independent sets in a graph (Q5439059):
Displaying 11 items.
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- Independent sets in graphs (Q501998) (← links)
- A simple proof that finding a maximal independent set in a graph is in NC (Q834937) (← links)
- An upper bound for the number of independent sets in regular graphs (Q1045204) (← links)
- Blocker size via matching minors (Q1637141) (← links)
- On the maximum number of maximum independent sets (Q1756132) (← links)
- An upper bound on the independence number of a graph computable in polynomial-time (Q1919180) (← links)
- Some properties of intersection graph of a module with an application of the graph of ℤ<sub>n</sub> (Q5034969) (← links)
- Lower Bounds for Maximal Matchings and Maximal Independent Sets (Q5056427) (← links)
- Systems of parameters and the Cohen-Macaulay property (Q5896848) (← links)
- Maximizing the number of independent sets of fixed size in Kn‐covered graphs (Q6056803) (← links)