Testing for Equality between Maximum Matching and Minimum Node Covering

DOI10.1016/0020-0190(77)90068-0zbMath0367.05056OpenAlexW2005835707MaRDI QIDQ1242177

Fanica Gavril

Publication date: 1977

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(77)90068-0

Mathematics Subject Classification ID

Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (9)

An efficiently solvable graph partition problem to which many problems are reducible ⋮ On some conjectures concerning critical independent sets of a graph ⋮ Parallel maximum independent set in convex bipartite graphs ⋮ Some more updates on an annihilation number conjecture: pros and cons ⋮ A switching algorithm for the solution of quadratic Boolean equations ⋮ On maximum matchings in König-Egerváry graphs ⋮ The complexity of König subgraph problems and above-guarantee vertex cover ⋮ Polynomial time recognition of essential graphs having stability number equal to matching number ⋮ Uniquely solvable quadratic Boolean equations

Cites Work

• Parallel concepts in graph theory
• Paths, Trees, and Flowers
• Unnamed Item

This page was built for publication: Testing for Equality between Maximum Matching and Minimum Node Covering