Now showing items 1-1 of 1

    • Bonomo, Flavia; Dourado, Mitre C.; Durán Maggiolo, Guillermo; Faria, Luerbio; Grippo, Luciano N.; Safe, Martín D. (Elsevier, 2013)
      The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the König–Egerváry property if its ...