Pages that link to "Item:Q1926061"
From MaRDI portal
The following pages link to Critical independent sets and König-Egerváry graphs (Q1926061):
Displaying 23 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)
- Critical sets in bipartite graphs (Q368442) (← links)
- Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363) (← links)
- On the intersection of all critical sets of a unicyclic graph (Q741775) (← links)
- Hall's and Kőnig's theorem in graphs and hypergraphs (Q1660258) (← links)
- Critical and maximum independent sets of a graph (Q1671323) (← links)
- Problems on matchings and independent sets of a graph (Q1744740) (← links)
- Critical independent sets of König-Egerváry graphs (Q2146733) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- On the critical difference of almost bipartite graphs (Q2159389) (← links)
- Some more updates on an annihilation number conjecture: pros and cons (Q2164992) (← links)
- On the König deficiency of zero-reducible graphs (Q2292142) (← 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 maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406) (← links)
- On an annihilation number conjecture (Q4988857) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- A classification of 1-well-covered graphs (Q5097748) (← links)
- On König-Egerváry collections of maximum critical independent sets (Q5198028) (← links)
- On critical difference, independence number and matching number of graphs (Q6133662) (← links)