Node-weighted graphs having the König-Egerváry property
From MaRDI portal
Publication:3222885
Recommendations
- Forbidden subgraphs and the König-Egerváry property
- On maximum matchings in König-Egerváry graphs
- Two more characterizations of König-Egerváry graphs
- An extension of the König-Egerváry property to node-weighted bidirected graphs
- A characterization of König-Egerváry graphs using a common property of all maximum matchings
Cited in
(17)- A characterization of König-Egerváry graphs using a common property of all maximum matchings
- A classification of 1-well-covered graphs
- An extension of the König-Egerváry property to node-weighted bidirected graphs
- When is \(G^2\) a König-Egerváry graph?
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Constructive -- non-constructive approximation and maximum independent set problem
- Two more characterizations of König-Egerváry graphs
- Crown reductions for the minimum weighted vertex cover problem
- Forbidden subgraphs and the Kőnig property
- A combinatorial column generation algorithm for the maximum stable set problem
- Probabilistic graph-coloring in bipartite and split graphs
- A priori optimization for the probabilistic maximum independent set problem
- On the critical difference of almost bipartite graphs
- Critical independent sets and König-Egerváry graphs
- On maximum matchings in König-Egerváry graphs
- Polynomial time recognition of essential graphs having stability number equal to matching number
This page was built for publication: Node-weighted graphs having the König-Egerváry property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222885)
