Pages that link to "Item:Q3222885"
From MaRDI portal
The following pages link to Node-weighted graphs having the König-Egerváry property (Q3222885):
Displaying 16 items.
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- An extension of the König-Egerváry property to node-weighted bidirected graphs (Q1108202) (← links)
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
- A combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210) (← links)
- Critical independent sets and König-Egerváry graphs (Q1926061) (← links)
- On the critical difference of almost bipartite graphs (Q2159389) (← links)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← 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)
- A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)
- Constructive -- non-constructive approximation and maximum independent set problem (Q6567680) (← links)
