Tutte sets in graphs I: Maximal tutte sets and D-graphs

@article{Bauer2007TutteSI,
  title={Tutte sets in graphs I: Maximal tutte sets and D-graphs},
  author={Douglas Bauer and Hajo Broersma and Aurora Morgana and Edward F. Schmeichel},
  journal={Journal of Graph Theory},
  year={2007},
  volume={55},
  pages={343-358}
}
A well-known formula of Tutte and Berge expresses the size of a maximum matching in G in terms of what is usually called the deficiency of G. A subset X of G for which this deficiency is attained is called a Tutte set of G. While much is known about maximum matchings, less is known about the structure of Tutte sets. In this paper, we study the structural aspects of maximal Tutte sets in a graph G. Towards this end, we introduce a related graph D(G). We first show that the maximal Tutte sets in… CONTINUE READING

From This Paper

Topics from this paper.
4 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Matching Theory

  • L. Lovász, M. D. Plummer
  • Ann. Discrete Math. Vol. 29, North-Holland…
  • 1986
Highly Influential
9 Excerpts

Sur le couplage maximum d’un graphe

  • C. Berge
  • C. R. Acad. Sci. (Paris), 247:258 – 259
  • 1958
Highly Influential
4 Excerpts

Introduction to Graph Theory

  • D. B. West
  • Prentice Hall, Upper Saddle River, New Jersey, 2…
  • 2001
1 Excerpt

Maximum matching and a polyhedron with 0,1-vertices

  • J. R. Edmonds
  • J Res Nat Bur Standards,
  • 1965
1 Excerpt

Similar Papers

Loading similar papers…