Pages that link to "Item:Q1278660"
From MaRDI portal
The following pages link to A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660):
Displaying 9 items.
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- Critical independent sets and König-Egerváry graphs (Q1926061) (← links)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- On \(\alpha\)-critical edges in König--Egerváry graphs (Q2502896) (← links)
- A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406) (← links)
- A classification of 1-well-covered graphs (Q5097748) (← links)
