Node-weighted graphs having the König-Egerváry property

This publication has 8 references indexed in Scilit:

• Vertices Belonging to All or to No Maximum Stable Sets of a Graph
  SIAM Journal on Algebraic Discrete Methods, 1982
• Dual integrality in b-matching problems
  Published by Springer Nature ,1980
• Independence numbers of graphs-an extension of the Koenig-Egervary theorem
  Discrete Mathematics, 1979
• A characterization of the graphs in which the transversal number equals the matching number
  Journal of Combinatorial Theory, Series B, 1979
• A linear-time algorithm for testing the truth of certain quantified boolean formulas
  Information Processing Letters, 1979
• An O(|V|3) algorithm for finding maximum flows in networks
  Information Processing Letters, 1978
• Testing for equality between maximum matching and minimum node covering
  Information Processing Letters, 1977
• A Short Proof of the Factor Theorem for Finite Graphs
  Canadian Journal of Mathematics, 1954