Finbow, Arthur S.; Hartnell, Bert L.; Plummer, Michael D. A characterization of well-indumatchable graphs having girth greater than seven. (English) Zbl 1497.05216 Discrete Appl. Math. 321, 261-271 (2022). MSC: 05C70 05C12 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. S. Finbow} et al., Discrete Appl. Math. 321, 261--271 (2022; Zbl 1497.05216) Full Text: DOI
Aldred, R. E. L.; Plummer, Michael D.; Ruksasakchai, Watcharintorn Asymmetric distance matching extension. (English) Zbl 1465.05134 Australas. J. Comb. 79, Part 1, 1-14 (2021). MSC: 05C70 PDFBibTeX XMLCite \textit{R. E. L. Aldred} et al., Australas. J. Comb. 79, Part 1, 1--14 (2021; Zbl 1465.05134) Full Text: Link
Győri, Ervin; Plummer, Michael D.; Ye, Dong; Zha, Xiaoya Cycle traversability for claw-free graphs and polyhedral maps. (English) Zbl 1463.05302 Combinatorica 40, No. 3, 405-433 (2020). Reviewer: Hang Lau (Montréal) MSC: 05C38 05C40 PDFBibTeX XMLCite \textit{E. Győri} et al., Combinatorica 40, No. 3, 405--433 (2020; Zbl 1463.05302) Full Text: DOI arXiv
Aldred, R. E. L.; Plummer, Michael D.; Ruksasakchai, Watcharintorn Restricted matching in plane triangulations and near triangulations. (English) Zbl 1443.05153 Discrete Appl. Math. 284, 251-261 (2020). MSC: 05C70 05C10 PDFBibTeX XMLCite \textit{R. E. L. Aldred} et al., Discrete Appl. Math. 284, 251--261 (2020; Zbl 1443.05153) Full Text: DOI
Aldred, R. E. L.; Plummer, Michael D. Extendability and criticality in matching theory. (English) Zbl 1439.05182 Graphs Comb. 36, No. 3, 573-589 (2020). MSC: 05C70 PDFBibTeX XMLCite \textit{R. E. L. Aldred} and \textit{M. D. Plummer}, Graphs Comb. 36, No. 3, 573--589 (2020; Zbl 1439.05182) Full Text: DOI
Plummer, Michael D. On the structure of graphs vertex critical with respect to connected domination. (English) Zbl 1359.05096 Cook, William J. (ed.) et al., Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer (ISBN 978-3-540-76795-4/hbk). 303-315 (2009). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{M. D. Plummer}, in: Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer. 303--315 (2009; Zbl 1359.05096) Full Text: DOI
Kawarabayashi, Ken-ichi; Plummer, Michael D. Bounding the size of equimatchable graphs of fixed genus. (English) Zbl 1191.05033 Graphs Comb. 25, No. 1, 91-99 (2009). Reviewer: Arthur T. White (Kalamazoo) MSC: 05C10 05C70 PDFBibTeX XMLCite \textit{K.-i. Kawarabayashi} and \textit{M. D. Plummer}, Graphs Comb. 25, No. 1, 91--99 (2009; Zbl 1191.05033) Full Text: DOI
Ananchuen, Nawarat; Plummer, Michael D. Matchings in 3-vertex-critical graphs: the odd case. (English) Zbl 1133.05073 Discrete Math. 307, No. 13, 1651-1658 (2007). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C70 05C69 PDFBibTeX XMLCite \textit{N. Ananchuen} and \textit{M. D. Plummer}, Discrete Math. 307, No. 13, 1651--1658 (2007; Zbl 1133.05073) Full Text: DOI
Plummer, Michael D. Graph factors and factorization: 1985–2003: a survey. (English) Zbl 1112.05088 Discrete Math. 307, No. 7-8, 791-821 (2007). MSC: 05C70 05-02 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 307, No. 7--8, 791--821 (2007; Zbl 1112.05088) Full Text: DOI
Ananchuen, Nawarat; Plummer, Michael D. Matchings in 3-vertex-critical graphs: the even case. (English) Zbl 1071.05060 Networks 45, No. 4, 210-213 (2005). MSC: 05C70 05C69 PDFBibTeX XMLCite \textit{N. Ananchuen} and \textit{M. D. Plummer}, Networks 45, No. 4, 210--213 (2005; Zbl 1071.05060) Full Text: DOI
Ananchuen, Nawarat; Plummer, Michael D. Matching properties in domination critical graphs. (English) Zbl 1033.05076 Discrete Math. 277, No. 1-3, 1-13 (2004); errata ibid. 306, 291 (2006). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{N. Ananchuen} and \textit{M. D. Plummer}, Discrete Math. 277, No. 1--3, 1--13 (2004; Zbl 1033.05076) Full Text: DOI
Kawarabayashi, Ken-ichi; Plummer, Michael D.; Saito, Akira On two equimatchable graph classes. (English) Zbl 1022.05065 Discrete Math. 266, No. 1-3, 263-274 (2003). Reviewer: Bal Kishan Dass (Delhi) MSC: 05C70 PDFBibTeX XMLCite \textit{K.-i. Kawarabayashi} et al., Discrete Math. 266, No. 1--3, 263--274 (2003; Zbl 1022.05065) Full Text: DOI
Aldred, R. E. L.; Plummer, Michael D. On matching extensions with prescribed and proscribed edge sets. II. (English) Zbl 0929.05068 Discrete Math. 197-198, 29-40 (1999). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C70 PDFBibTeX XMLCite \textit{R. E. L. Aldred} and \textit{M. D. Plummer}, Discrete Math. 197--198, 29--40 (1999; Zbl 0929.05068) Full Text: DOI
Hartnell, Bert; Plummer, Michael D. On 4-connected claw-free well-covered graphs. (English) Zbl 0859.05051 Discrete Appl. Math. 64, No. 1, 57-65 (1996). Reviewer: S.L.Bezrukov (Paderborn) MSC: 05C35 05C75 68R10 PDFBibTeX XMLCite \textit{B. Hartnell} and \textit{M. D. Plummer}, Discrete Appl. Math. 64, No. 1, 57--65 (1996; Zbl 0859.05051) Full Text: DOI Link
Plummer, Michael D. Extending matchings in planar graphs. V. (English) Zbl 0848.05052 Discrete Math. 150, No. 1-3, 315-324 (1996). MSC: 05C70 05C10 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 150, No. 1--3, 315--324 (1996; Zbl 0848.05052) Full Text: DOI
Plummer, Michael D. Extending matchings in claw-free graphs. (English) Zbl 0798.05041 Discrete Math. 125, No. 1-3, 301-307 (1994). Reviewer: K.R.Parthasarathy (Madras) MSC: 05C70 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 125, No. 1--3, 301--307 (1994; Zbl 0798.05041) Full Text: DOI
Plummer, Michael D. Extending matchings in graphs: A survey. (English) Zbl 0798.05040 Discrete Math. 127, No. 1-3, 277-292 (1994). Reviewer: K.R.Parthasarathy (Madras) MSC: 05C70 05-02 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 127, No. 1--3, 277--292 (1994; Zbl 0798.05040) Full Text: DOI
Plummer, Michael D. Well-covered graphs: A survey. (English) Zbl 0817.05068 Quaest. Math. 16, No. 3, 253-287 (1993). MSC: 05C99 05C35 05C85 PDFBibTeX XMLCite \textit{M. D. Plummer}, Quaest. Math. 16, No. 3, 253--287 (1993; Zbl 0817.05068) Full Text: DOI
Plummer, Michael D. Matching theory – a sampler: From Dénes König to the present. (English) Zbl 0774.05080 Discrete Math. 100, No. 1-3, 177-219 (1992). Reviewer: K.Engel (Rostock) MSC: 05C70 05C80 05C85 05D15 90C05 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 100, No. 1--3, 177--219 (1992; Zbl 0774.05080) Full Text: DOI
Györi, E.; Plummer, M. D. The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable. (English) Zbl 0769.05075 Discrete Math. 101, No. 1-3, 87-96 (1992). Reviewer: P.Reichensperger (Oberasbach) MSC: 05C70 PDFBibTeX XMLCite \textit{E. Györi} and \textit{M. D. Plummer}, Discrete Math. 101, No. 1--3, 87--96 (1992; Zbl 0769.05075) Full Text: DOI
Plummer, Michael D. Extending matchings in planar graphs. IV. (English) Zbl 0779.05035 Discrete Math. 109, No. 1-3, 207-219 (1992). Reviewer: P.Reichensperger (Oberasbach) MSC: 05C70 05C10 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 109, No. 1--3, 207--219 (1992; Zbl 0779.05035) Full Text: DOI
Holton, D. A.; Lou, Dingjun; Plummer, Michael D. On the 2-extendability of planar graphs. (English) Zbl 0751.05062 Discrete Math. 96, No. 2, 81-99 (1991). Reviewer: P.Reichensperger (Oberasbach) MSC: 05C40 05C99 PDFBibTeX XMLCite \textit{D. A. Holton} et al., Discrete Math. 96, No. 2, 81--99 (1991; Zbl 0751.05062) Full Text: DOI
Plummer, M. D. Toughness and matching extension in graphs. (English) Zbl 0683.05034 Discrete Math. 72, No. 1-3, 311-320 (1988). Reviewer: A.Hartman MSC: 05C70 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 72, No. 1--3, 311--320 (1988; Zbl 0683.05034) Full Text: DOI
Plummer, Michael D. Matching extension and the genus of a graph. (English) Zbl 0653.05054 J. Comb. Theory, Ser. B 44, No. 3, 329-337 (1988). Reviewer: A.T.White MSC: 05C70 05C10 PDFBibTeX XMLCite \textit{M. D. Plummer}, J. Comb. Theory, Ser. B 44, No. 3, 329--337 (1988; Zbl 0653.05054) Full Text: DOI
Holton, D. A.; McKay, B. D.; Plummer, M. D.; Thomassen, C. A nine point theorem for 3-connected graphs. (English) Zbl 0488.05047 Combinatorica 2, 53-62 (1982). MSC: 05C38 05C40 PDFBibTeX XMLCite \textit{D. A. Holton} et al., Combinatorica 2, 53--62 (1982; Zbl 0488.05047) Full Text: DOI
Plummer, M. D. On n-extendable graphs. (English) Zbl 0442.05060 Discrete Math. 31, 201-210 (1980). MSC: 05C99 05C40 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 31, 201--210 (1980; Zbl 0442.05060) Full Text: DOI
Lovász, László; Plummer, M. D. On minimal elementary bipartite graphs. (English) Zbl 0375.05036 J. Comb. Theory, Ser. B 23, 127-138 (1977). MSC: 05C35 05C99 PDFBibTeX XMLCite \textit{L. Lovász} and \textit{M. D. Plummer}, J. Comb. Theory, Ser. B 23, 127--138 (1977; Zbl 0375.05036) Full Text: DOI