Pages that link to "Item:Q3137766"
From MaRDI portal
The following pages link to Maximal independent sets in bipartite graphs (Q3137766):
Displayed 19 items.
- Independent sets in graphs (Q501998) (← links)
- Maximal independent sets in caterpillar graphs (Q765369) (← links)
- Trees with maximum number of maximal matchings (Q878628) (← links)
- Graphs with the second largest number of maximal independent sets (Q998481) (← links)
- Facets for node packing (Q1278997) (← links)
- The number of maximal independent sets in connected triangle-free graphs (Q1292823) (← links)
- Maximal independent sets in graphs with at most one cycle (Q1372731) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Fixed points and maximal independent sets in AND-OR networks (Q1827803) (← links)
- Trees with a given number of leaves and the maximal number of maximum independent sets (Q2031165) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- Trees without twin-leaves with smallest number of maximal independent sets (Q2295975) (← links)
- Maximum number of fixed points in AND-OR-NOT networks (Q2453540) (← links)
- A finiteness theorem for maximal independent sets (Q2563420) (← links)
- On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets (Q4558291) (← links)
- Maximal independent sets and regularity of graphs (Q4958324) (← links)
- Coverings, Matchings and the number of maximal independent sets of graphs (Q5377038) (← 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)