@techreport{TR-DCC-95-09,
  number = {DCC-95-09},
  author = {Lucchesi, Cláudio L. and Carvalho, Marcelo H.},
  title = {Bases for the Matching Lattice of Matching Covered Graphs},
  month = {July},
  year = {1995}, 
  institution = {Department of Computer Science, University of Campinas},
  note = {In English, 7 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      This article contains a brief introduction to the theory of
      matching covered graphs: ear-decompositions, the matching lattice
      and the most important results of the theory. Its last section
      contains rather recent results and a conjecture relating the
      minimum number of double ears of any ear-decomposition of a
      matching covered graph and the number of bricks and bricks
      isomorphic to the Petersen graph in any brick decomposition of the
      same graph.
  }
}