论文信息 - Bipartite matching extendable graphs

Bipartite matching extendable graphs

Matching extendability is significant in graph theory and its applications. The basic notion in this direction is n-extendability introduced by Plummer in 1980. Motivated by the different natures of bipartite matchings and non-bipartite matchings, this paper investigates bipartite-matching extendable (BM-extendable) graphs. A graph G is said to be BM-extendable if every matching M which is a perfect matching of an induced bipartite subgraph can be extended to a perfect matching. Our main results are showing that the recognition of BM-extendable graphs is co-NP-complete and characterizing some classes of BM-extendable graphs.

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] Jinjiang Yuan. Induced matching extendable graphs , 1998, J. Graph Theory.

[3] Yuan Jinjiang. Induced matching extendable graphs , 1998 .

[4] G. Winskel. What Is Discrete Mathematics , 2007 .

[5] Michael D. Plummer,et al. On n-extendable graphs , 1980, Discret. Math..

[6] Dingjun Lou,et al. Characterizing 2k-critical graphs and n-extendable graphs , 2004, Discret. Math..

[7] Dingjun Lou,et al. On the structure of minimally n-extendable bipartite graphs , 1999, Discret. Math..

[8] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[9] Y Jinjiang,et al. NP-Completeness of Induced Matching Problem and Co-NP-Completeness of Induced Matching Extendable Problem , 2000 .

[10] Heping Zhang,et al. Plane elementary bipartite graphs , 2000, Discret. Appl. Math..

[11] Jinjiang Yuan,et al. Maximal IM-unextendable graphs , 2001, Discret. Math..

[12] Angelika Steger,et al. On induced matchings , 1993, Discret. Math..

[13] Lou Caccetta,et al. On minimally k-extendable graphs , 1994, Australas. J Comb..

[14] Pierre Hansen,et al. Perfect matchings and ears in elementary bipartite graphs , 1996, Discret. Math..

[15] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .