Pages that link to "Item:Q616388"
From MaRDI portal
The following pages link to The critical independence number and an independence decomposition (Q616388):
Displaying 19 items.
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Critical and maximum independent sets of a graph (Q1671323) (← links)
- Critical independent sets and König-Egerváry graphs (Q1926061) (← links)
- Regular graphs with equal matching number and independence number (Q2074360) (← links)
- Critical independent sets of König-Egerváry graphs (Q2146733) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- New results relating independence and matchings (Q2151222) (← links)
- Some more updates on an annihilation number conjecture: pros and cons (Q2164992) (← links)
- Monotonic properties of collections of maximum independent sets of a graph (Q2314418) (← links)
- A new eigenvalue bound for independent sets (Q2346340) (← links)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- On some conjectures concerning critical independent sets of a graph (Q2629485) (← links)
- A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406) (← links)
- On an annihilation number conjecture (Q4988857) (← links)
- On König-Egerváry collections of maximum critical independent sets (Q5198028) (← links)
