Acta mathematica scientia,Series A ›› 2009, Vol. 29 ›› Issue (2): 486-493.

• Articles • Previous Articles     Next Articles

Factor-critical Graph  G with |V(G)|+2} Maximum Matchings

  

  1. (Department of Mathematics, South China Normal University,  Guangzhou 510631);(Huali School, Guangdong University of Technology,  Guangzhou 510631)
  • Received:2007-12-30 Revised:2008-12-27 Online:2009-04-25 Published:2009-04-25
  • Supported by:

    教育部博士点基金(20070574006)与国家自然科学基金(10201019)资助

Abstract:

A connected graph G is said to be factor-critical if G-v has a perfect matching for  every vertex v of G.
In this paper, the factor-critical graph G with |V(G)|+2 maximum matchings is characterized. By this, some special
bicritical graphs are characterized.

Key words: Maximum matching, Factor-critical graph, Bicritical graph

CLC Number: 

  • 05C47
Trendmd