Pages that link to "Item:Q2446347"
From MaRDI portal
The following pages link to On maximum matchings in König-Egerváry graphs (Q2446347):
Displaying 19 items.
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- Crowns in bipartite graphs (Q510531) (← links)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- On the intersection of all critical sets of a unicyclic graph (Q741775) (← links)
- Critical and maximum independent sets of a graph (Q1671323) (← 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)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- On some conjectures concerning critical independent sets of a graph (Q2629485) (← links)
- On an annihilation number conjecture (Q4988857) (← links)
- On graphs admitting two disjoint maximum independent sets (Q5058163) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- On König-Egerváry collections of maximum critical independent sets (Q5198028) (← links)
- Independence, matching and packing coloring of the iterated Mycielskian of graphs (Q6657219) (← links)
