Combinatorica

, Volume 16, Issue 2, pp 233–241

On a matroid defined by ear-decompositions of graphs

  • Zoltán Szigeti
Article

DOI: 10.1007/BF01844849

Cite this article as:
Szigeti, Z. Combinatorica (1996) 16: 233. doi:10.1007/BF01844849

Abstract

A. Frank described in [1] an algorithm to determine the minimum number of edges in a graph G whose contraction leaves a factor-critical graph and he asked if there was an algorithm for the weighted version of the problem. We prove that the minimal critical-making edge-sets form the bases of a matroid and hence the matroid greedy algorithm gives rise to the desired algorithm.

Mathematics Subject Classification (1991)

05 C 70 05 C 75 

Copyright information

© Akadémiai Kiadó 1996

Authors and Affiliations

  • Zoltán Szigeti
    • 1
  1. 1.Department of Operations ResearchEötvös UniversityBudapestHungary

Personalised recommendations