Testing for Equality between Maximum Matching and Minimum Node Covering

DOI10.1016/0020-0190(77)90068-0MaRDI QIDQ1242177zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3298614 (Why is no real title available?)
• Parallel concepts in graph theory
• Paths, Trees, and Flowers

Cited in

(9)

• A switching algorithm for the solution of quadratic Boolean equations
• Uniquely solvable quadratic Boolean equations
• On some conjectures concerning critical independent sets of a graph
• The complexity of König subgraph problems and above-guarantee vertex cover
• An efficiently solvable graph partition problem to which many problems are reducible
• Parallel maximum independent set in convex bipartite graphs
• Some more updates on an annihilation number conjecture: pros and cons
• 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: 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)