Path traversability in planar graphs. - Michael D. Plummer; Neil Robertson 001 (Discret. Math., 1974)

On minimal elementary bipartite graphs. - László Lovász 001; Michael D. Plummer (J. Comb. Theory B, 1977)

On n-extendable graphs. - Michael D. Plummer (Discret. Math., 1980)

A nine point theorem for 3-connected graphs. - Derek A. Holton; Brendan D. McKay; Michael D. Plummer; Carsten Thomassen (Comb., 1982)

Cyclic coloration of 3-polytopes. - Michael D. Plummer; Bjarne Toft (J. Graph Theory, 1987)

Toughness and matching extension in graphs. - Michael D. Plummer (Discret. Math., 1988)

Matching extension and the genus of a graph. - Michael D. Plummer (J. Comb. Theory B, 1988)

On the 2-extendability of planar graphs. - Derek A. Holton; Dingjun Lou; Michael D. Plummer (Discret. Math., 1991)

The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. - Ervin Györi; Michael D. Plummer (Discret. Math., 1992)

Matching theory - a sampler: from Dénes König to the present. - Michael D. Plummer (Discret. Math., 1992)

Extending matchings in planar graphs IV. - Michael D. Plummer (Discret. Math., 1992)

Extending matchings in claw-free graphs. - Michael D. Plummer (Discret. Math., 1994)

Extending matchings in graphs: A survey. - Michael D. Plummer (Discret. Math., 1994)

On 4-connected Claw-free Well-covered Graphs. - Bert L. Hartnell; Michael D. Plummer (Discret. Appl. Math., 1996)

Extending matchings in planar graphs V. - Michael D. Plummer (Discret. Math., 1996)

Maximum and minimum toughness of graphs of small genus. - Wayne Goddard; Michael D. Plummer; Henda C. Swart (Discret. Math., 1997)

On the Connectivity of Graphs Embedded in Surfaces. - Michael D. Plummer; Xiaoya Zha (J. Comb. Theory B, 1998)

Two results on matching extensions with prescribed and proscribed edge sets. - Robert E. L. Aldred; Derek A. Holton; M. I. Porteous; Michael D. Plummer (Discret. Math., 1999)

On matching extensions with prescribed and proscribed edge sets II. - Robert E. L. Aldred; Michael D. Plummer (Discret. Math., 1999)

Neighborhood unions and factor critical graphs. - Hikoe Enomoto; Michael D. Plummer; Akira Saito (Discret. Math., 1999)

Closure and factor-critical graphs. - Michael D. Plummer; Akira Saito (Discret. Math., 2000)

Bounds for isoperimetric constants of infinite plane graphs. - Serge Lawrencenko; Michael D. Plummer; Xiaoya Zha (Discret. Appl. Math., 2001)

On restricted matching extension in planar graphs. - Robert E. L. Aldred; Michael D. Plummer (Discret. Math., 2001)

On the Connectivity of Graphs Embedded in Surfaces II. - Michael D. Plummer; Xiaoya Zha (Electron. J. Comb., 2002)

Isoperimetric Constants of Infinite Plane Graphs. - Serge Lawrencenko; Michael D. Plummer; Xiaoya Zha (Discret. Comput. Geom., 2002)

Genus bounds for embeddings with large minimum degree and representativity. - Michael D. Plummer; Xiaoya Zha (Discret. Math., 2002)

On well-covered triangulations: Part I. - Art S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer (Discret. Appl. Math., 2003)

Some results related to the toughness of 3-domination critical graphs. - Nawarat Ananchuen; Michael D. Plummer (Discret. Math., 2003)

On two equimatchable graph classes. - Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito (Discret. Math., 2003)

On a special case of Hadwiger's conjecture. - Michael D. Plummer; Michael Stiebitz; Bjarne Toft (Discuss. Math. Graph Theory, 2003)

Edge proximity and matching extension in planar triangulations. - Robert E. L. Aldred; Michael D. Plummer (Australas. J Comb., 2004)

Matching properties in domination critical graphs. - Nawarat Ananchuen; Michael D. Plummer (Discret. Math., 2004)

On the p-factor-criticality of the Klein bottle. - Michael D. Plummer; Xiaoya Zha (Discret. Math., 2004)

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. - Michael A. Henning; Michael D. Plummer (J. Comb. Optim., 2005)

Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture. - Ken-ichi Kawarabayashi; Michael D. Plummer; Bjarne Toft (J. Comb. Theory B, 2005)

Forbidden subgraphs and bounds on the size of a maximum matching. - Michael D. Plummer; Akira Saito (J. Graph Theory, 2005)

Matchings in 3-vertex-critical graphs: The even case. - Nawarat Ananchuen; Michael D. Plummer (Networks, 2005)

Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. - Nawarat Ananchuen; Michael D. Plummer (Discret. Math., 2006)

Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15]. - Nawarat Ananchuen; Michael D. Plummer (Discret. Math., 2006)

Some recent results on domination in graphs. - Michael D. Plummer (Discuss. Math. Graph Theory, 2006)

A pair of forbidden subgraphs and perfect matchings. - Shinya Fujita 001; Ken-ichi Kawarabayashi; Cláudio Leonardo Lucchesi; Katsuhiro Ota; Michael D. Plummer; Akira Saito (J. Comb. Theory B, 2006)

Domination in a graph with a 2-factor. - Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito (J. Graph Theory, 2006)

Matchings in 3-vertex-critical graphs: The odd case. - Nawarat Ananchuen; Michael D. Plummer (Discret. Math., 2007)

3-Factor-criticality in domination critical graphs. - Nawarat Ananchuen; Michael D. Plummer (Discret. Math., 2007)

Graph factors and factorization: 1985-2003: A survey. - Michael D. Plummer (Discret. Math., 2007)

On the Structure of Graphs Vertex Critical with Respect to Connected Domination. - Michael D. Plummer (Bonn Workshop of Combinatorial Optimization, 2008)

Restricted matching in graphs of small genus. - Robert E. L. Aldred; Michael D. Plummer (Discret. Math., 2008)

Matching properties in connected domination critical graphs. - Nawarat Ananchuen; Watcharaphong Ananchuen; Michael D. Plummer (Discret. Math., 2008)

On the matching extendability of graphs in surfaces. - Robert E. L. Aldred; Ken-ichi Kawarabayashi; Michael D. Plummer (J. Comb. Theory B, 2008)

On well-covered triangulations: Part II. - Art S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer (Discret. Appl. Math., 2009)

On certain spanning subgraphs of embeddings with applications to domination. - Michael D. Plummer; Xiaoya Zha (Discret. Math., 2009)

Bounding the Size of Equimatchable Graphs of Fixed Genus. - Ken-ichi Kawarabayashi; Michael D. Plummer (Graphs Comb., 2009)

On well-covered triangulations: Part III. - Arthur S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer (Discret. Appl. Math., 2010)

Distance-restricted matching extension in planar triangulations. - Robert E. L. Aldred; Michael D. Plummer (Discret. Math., 2010)

A note on traversing specified vertices in graphs embedded with large representativity. - Ken-ichi Kawarabayashi; Michael D. Plummer (Discret. Math., 2010)

Domination in Graphs. - Nawarat Ananchuen; Watcharaphong Ananchuen; Michael D. Plummer (Structural Analysis of Complex Networks, 2011)

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. - Jun Fujisawa; Shinya Fujita 001; Michael D. Plummer; Akira Saito; Ingo Schiermeyer (Comb., 2011)

On a Conjecture Concerning the Petersen Graph. - Donald Nelson; Michael D. Plummer; Neil Robertson 001; Xiaoya Zha (Electron. J. Comb., 2011)

The 2-extendability of 5-connected graphs on surfaces with large representativity. - Ken-ichi Kawarabayashi; Seiya Negami; Michael D. Plummer; Yusuke Suzuki (J. Comb. Theory B, 2011)

Proximity thresholds for matching extension in planar and projective planar triangulations. - Robert E. L. Aldred; Michael D. Plummer (J. Graph Theory, 2011)

Forbidden triples for perfect matchings. - Katsuhiro Ota; Michael D. Plummer; Akira Saito (J. Graph Theory, 2011)

Graphs with the cycle extension property. - Robert E. L. Aldred; Michael D. Plummer (Australas. J Comb., 2012)

Proximity thresholds for matching extension in the torus and Klein bottle. - Robert E. L. Aldred; Michael D. Plummer (Discret. Appl. Math., 2012)

Linkage for the diamond and the path with four vertices. - Mark N. Ellingham; Michael D. Plummer; Gexin Yu (J. Graph Theory, 2012)

Matching extension in quadrangulations of the torus. - Robert E. L. Aldred; Qiuli Li; Michael D. Plummer; Heping Zhang (Australas. J Comb., 2013)

Forbidden subgraphs generating a finite set. - Jun Fujisawa; Michael D. Plummer; Akira Saito (Discret. Math., 2013)

On a Conjecture Concerning the Petersen Graph: Part II. - Michael D. Plummer; Xiaoya Zha (Electron. J. Comb., 2014)

A note on graphs contraction-critical with respect to independence number. - Michael D. Plummer; Akira Saito (Discret. Math., 2014)

A Note on Cyclic Connectivity and Matching Properties of Regular Graphs. - Michael D. Plummer; Tao Wang 005; Qinglin Yu (Graphs Comb., 2014)

Matching extension in toroidal quadrangulations II: the 3-extendable case. - Robert E. L. Aldred; Qiuli Li; Michael D. Plummer; Dong Ye 002; Heping Zhang (Australas. J Comb., 2015)

Forbidden Triples Generating a Finite set of 3-Connected Graphs. - Yoshimi Egawa; Jun Fujisawa; Michitaka Furuya; Michael D. Plummer; Akira Saito (Electron. J. Comb., 2015)

Perfect matchings avoiding prescribed edges in a star-free graph. - Yoshimi Egawa; Jun Fujisawa; Michael D. Plummer; Akira Saito; Tomoki Yamashita (Discret. Math., 2015)

Well-covered triangulations: Part IV. - Arthur S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer (Discret. Appl. Math., 2016)

Dominating plane triangulations. - Michael D. Plummer; Dong Ye 002; Xiaoya Zha (Discret. Appl. Math., 2016)

Matching extension in prism graphs. - Robert E. L. Aldred; Michael D. Plummer (Discret. Appl. Math., 2017)

On well-covered pentagonalizations of the plane. - Arthur S. Finbow; Bert L. Hartnell; Michael D. Plummer (Discret. Appl. Math., 2017)

Connectivity and Wv -Paths in Polyhedral Maps on Surfaces. - Michael D. Plummer; Dong Ye 002; Xiaoya Zha (Discret. Comput. Geom., 2017)

Toughness, binding number and restricted matching extension in a graph. - Michael D. Plummer; Akira Saito (Discret. Math., 2017)

Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. - Ken-ichi Kawarabayashi; Kenta Ozeki; Michael D. Plummer (J. Graph Theory, 2017)

Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. - Ervin Györi; Michael D. Plummer; Dong Ye 002; Xiaoya Zha (Comb., 2020)

Restricted matching in plane triangulations and near triangulations. - Robert E. L. Aldred; Michael D. Plummer; Watcharintorn Ruksasakchai (Discret. Appl. Math., 2020)

On the structure of 4-regular planar well-covered graphs. - Arthur S. Finbow; Bert L. Hartnell; Michael D. Plummer (Discret. Appl. Math., 2020)

Dominating maximal outerplane graphs and Hamiltonian plane triangulations. - Michael D. Plummer; Dong Ye 002; Xiaoya Zha (Discret. Appl. Math., 2020)

Extendability and Criticality in Matching Theory. - Robert E. L. Aldred; Michael D. Plummer (Graphs Comb., 2020)

Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane. - Robert E. L. Aldred; Michael D. Plummer; Watcharintorn Ruksasakchai (J. Graph Theory, 2020)

Asymmetric distance matching extension. - Robert E. L. Aldred; Michael D. Plummer; Watcharintorn Ruksasakchai (Australas. J Comb., 2021)

A characterization of well-indumatchable graphs having girth greater than seven. - Arthur S. Finbow; Bert L. Hartnell; Michael D. Plummer (Discret. Appl. Math., 2022)

Edge proximity conditions for extendability in regular bipartite graphs. - Robert E. L. Aldred; Bill Jackson; Michael D. Plummer (J. Graph Theory, 2023)