• Title of article

    The Two Ear Theorem on Matching-Covered Graphs

  • Author/Authors

    Szigeti، نويسنده , , Zoltلn، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1998
  • Pages
    6
  • From page
    104
  • To page
    109
  • Abstract
    We give a simple and short proof for the two ear theorem on matching-covered graphs which is a well-known result of Lovلsz and Plummer. The proof relies only on the classical results of Tutte and Hall on perfect matchings in (bipartite) graphs.
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    1998
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1526402

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1526402