Testing for Equality between Maximum Matching and Minimum Node Covering
From MaRDI portal
Cites work
Cited in
(20)- Uniquely solvable quadratic Boolean equations
- A switching algorithm for the solution of quadratic Boolean equations
- Parallel maximum independent set in convex bipartite graphs
- Some more updates on an annihilation number conjecture: pros and cons
- An efficiently solvable graph partition problem to which many problems are reducible
- On maximum matchings in König-Egerváry graphs
- On some conjectures concerning critical independent sets of a graph
- Polynomial time recognition of essential graphs having stability number equal to matching number
- The complexity of König subgraph problems and above-guarantee vertex cover
- On 1-König-Egerváry graphs
- On the Kőnig-Egerváry index of a graph
- On König-Egerváry corona graphs
- Vertex cover and feedback vertex set above and below structural guarantees
- The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph
- On almost bipartite non-König-Egerváry graphs
- On the determinant of Kőnig-Egerváry graphs
- The core-forcing principle for perfect flowers
- The SD-KE decomposition through the Larson matching interface
- New structural bounds for \(\operatorname{ker}(G)\) and \(\operatorname{core}(G)\)
- A core-corona characterization of König-Egerváry graphs
This page was built for publication: Testing for Equality between Maximum Matching and Minimum Node Covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242177)
