Pages that link to "Item:Q2857406"
From MaRDI portal
The following pages link to A characterization of König-Egerváry graphs using a common property of all maximum matchings (Q2857406):
Displaying 18 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)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- König-Egerváry graphs are non-Edmonds (Q605001) (← links)
- Graphs with equal independence and annihilation numbers (Q640438) (← links)
- A characterization of König-Egerváry graphs with extendable vertex covers (Q783699) (← links)
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
- Characterizations of maximum matching graphs of certain types (Q1772424) (← links)
- On \(\alpha^{+}\)-stable König-Egerváry graphs (Q1869204) (← links)
- Critical independent sets and König-Egerváry graphs (Q1926061) (← 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)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Forbidden subgraphs and the Kőnig property (Q2840731) (← links)
- Node-weighted graphs having the König-Egerváry property (Q3222885) (← links)
- On König-Egerváry collections of maximum critical independent sets (Q5198028) (← links)
- The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
