Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Extendability and Criticality in Matching Theory

  • 10 Accesses


A connected graph G has property E(mn) (or more briefly “G is E(mn)”) if for every pair of disjoint matchings M and N in G with \(|M|=m\) and \(|N|=n\) respectively, there is a perfect matching F in G such that \(M\subseteq F\) and \(N\cap F=\emptyset \). In particular, a graph which has the E(m, 0) property is said to be m-extendable. Also a graph G which has the property that \(G-u-v\) has a perfect matching for every pair of distinct vertices u and v is said to be bicritical. In the present paper we investigate further the interrelation between extendability and criticality. In Lovász and Plummer (Matching theory, North-Holland Publisher, Amsterdam, 1986) author proved that a 2-extendable graph is either 1-extendable and bipartite, or else bicritical (clearly a graph cannot be both). In the present paper we generalize this result by extending the notion of bicriticality in several ways and studying the relationships of these extensions to extendability.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2


  1. 1.

    Aldred, R.E.L., Plummer, M.D.: Edge proximity and matching extension in planar triangulations. Aust. J. Comb. 29, 215–224 (2004)

  2. 2.

    Aldred, R.E.L., Plummer, M.D.: Matching extension in prism graphs. Discrete Appl. Math. 221, 25–32 (2017)

  3. 3.

    Aldred, R.E.L., Plummer, M.D., Ruksasakchai: Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane, (submitted)

  4. 4.

    Biebighauser, D., Ellingham, M.: Prism-Hamiltonicity of triangulations. J. Gr. Theory 57, 181–197 (2008)

  5. 5.

    Bondy, J., Murty, U.S.R.: Graph Theory with Applications. American Elsevier, New York (1976)

  6. 6.

    Györi, E., Plummer, M.: The Cartesian product of a \(k\)-extendable and an \(\ell \)-extendable graph is \((k+\ell +1)\)-extendable. Discrete Math. 101, 87–96 (1992)

  7. 7.

    Hackfeld, J., Koster, A.M.C.A.: The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. 35, 853–859 (2018)

  8. 8.

    Hammack, R., Imrich, W., Klavžar, S.: Handbook of product graphs. CRC, Boca Raton (2001)

  9. 9.

    Imrich, W., Klavžar, S.: Product Graphs. Wiley-Interscience, New York (2000)

  10. 10.

    Imrich, W., Klavžar, S., Rall, D.: Topics in Graph Theory, Graphs and Their Cartesian Products. A.K. Peters, Ltd., Wellesley (2008)

  11. 11.

    Kaiser, T., Ryjáček, Z., Král, D., Rosenfeld, M., Voss, H.-J.: Hamilton cycles in prisms. J. Gr. Theory 56, 249–269 (2007)

  12. 12.

    Lakhal, J., Litzler, L.: A polynomial algorithm for the extendability problem in bipartite graphs. Inform. Process. Lett. 65, 11–16 (1998)

  13. 13.

    Liu, G., Yu, Q.R.: Graph Factors and Matching Extensions. Higher Education Press, Beijing (2009)

  14. 14.

    Liu, G., Yu, Q.R.: Matching extension and products of graphs, Quo vadis, graph theory?, Ann. Discrete Math. 55 North-Holland, Amsterdam, pp. 191–200 (1993)

  15. 15.

    Lovász, L., Plummer, M.D.: Matching Theory, North-Holland Math. Studies 121 Ann. Discrete Math. 29 , North-Holland Publ. Co., Amsterdam (1986). (Reprinted: AMS Chelsea Publishing, Providence, RI, 2009)

  16. 16.

    Plummer, M.D.: On \(n\)-extendable graphs. Discrete Math. 31, 201–210 (1980)

  17. 17.

    Plummer, M.D.: A theorem on matchings in the plane. Ann. Discrete Math. 41, 347–354 (1989)

  18. 18.

    Plummer, M.D.: Extending matchings in graphs: a survey. Discrete Math. 127, 277–292 (1994)

  19. 19.

    Plummer, M.D.: Extending matchings in graphs: an update. Congr. Numer. 116, 3–32 (1996)

  20. 20.

    Plummer, M.D.: Recent progress in matching extension. In: Building Bridges Bolyai Soc. Math. Stud. vol 19. Springer, Berlin, pp. 427–454 (2008)

  21. 21.

    Porteous, M., Aldred, R.E.L.: Matching extensions with prescribed and forbidden edges. Aust. J. Comb. 13, 163–174 (1996)

  22. 22.

    Zhai, S., Guo, X.: Extending matchings in odd graphs. Acta Math. Sci. Ser. A 29, 365–372 (2009)

  23. 23.

    Zhai, S., Guo, X.: Extending matchings in planar odd graphs. Ars Comb. 121, 81–88 (2015)

Download references

Author information

Correspondence to R. E. L. Aldred.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Aldred, R.E.L., Plummer, M.D. Extendability and Criticality in Matching Theory. Graphs and Combinatorics (2020). https://doi.org/10.1007/s00373-020-02139-y

Download citation


  • Matching extension
  • Bicritical
  • k-critical