Michael D. Plummer

Publication Activity (10 Years)

Years Active: 1974-2023
Publications (10 Years): 16

Top Topics

Bipartite Graph

Top Venues

Discret. Appl. Math.

J. Graph Theory

Australas. J Comb.

Publications

Robert E. L. Aldred, Bill Jackson, Michael D. Plummer
Edge proximity conditions for extendability in regular bipartite graphs. J. Graph Theory 104 (2) (2023)
Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
A characterization of well-indumatchable graphs having girth greater than seven. Discret. Appl. Math. 321 (2022)
Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai
Asymmetric distance matching extension. Australas. J Comb. 79 (2021)
Ervin Györi, Michael D. Plummer, Dong Ye, Xiaoya Zha
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. Comb. 40 (3) (2020)
Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai
Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane. J. Graph Theory 95 (2) (2020)
Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
On the structure of 4-regular planar well-covered graphs. Discret. Appl. Math. 283 (2020)
Robert E. L. Aldred, Michael D. Plummer
Extendability and Criticality in Matching Theory. Graphs Comb. 36 (3) (2020)
Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai
Restricted matching in plane triangulations and near triangulations. Discret. Appl. Math. 284 (2020)
Michael D. Plummer, Dong Ye, Xiaoya Zha
Dominating maximal outerplane graphs and Hamiltonian plane triangulations. Discret. Appl. Math. 282 (2020)
Michael D. Plummer, Dong Ye, Xiaoya Zha
-Paths in Polyhedral Maps on Surfaces. Discret. Comput. Geom. 58 (1) (2017)
Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
On well-covered pentagonalizations of the plane. Discret. Appl. Math. 224 (2017)
Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. J. Graph Theory 85 (1) (2017)
Michael D. Plummer, Akira Saito
Toughness, binding number and restricted matching extension in a graph. Discret. Math. 340 (11) (2017)
Robert E. L. Aldred, Michael D. Plummer
Matching extension in prism graphs. Discret. Appl. Math. 221 (2017)
Michael D. Plummer, Dong Ye, Xiaoya Zha
Dominating plane triangulations. Discret. Appl. Math. 211 (2016)
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
Well-covered triangulations: Part IV. Discret. Appl. Math. 215 (2016)
Yoshimi Egawa, Jun Fujisawa, Michitaka Furuya, Michael D. Plummer, Akira Saito
Forbidden Triples Generating a Finite set of 3-Connected Graphs. Electron. J. Comb. 22 (3) (2015)
Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Dong Ye, Heping Zhang
Matching extension in toroidal quadrangulations II: the 3-extendable case. Australas. J Comb. 63 (2015)
Yoshimi Egawa, Jun Fujisawa, Michael D. Plummer, Akira Saito, Tomoki Yamashita
Perfect matchings avoiding prescribed edges in a star-free graph. Discret. Math. 338 (12) (2015)
Michael D. Plummer, Xiaoya Zha
On a Conjecture Concerning the Petersen Graph: Part II. Electron. J. Comb. 21 (1) (2014)
Michael D. Plummer, Akira Saito
A note on graphs contraction-critical with respect to independence number. Discret. Math. 325 (2014)
Michael D. Plummer, Tao Wang, Qinglin Yu
A Note on Cyclic Connectivity and Matching Properties of Regular Graphs. Graphs Comb. 30 (4) (2014)
Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Heping Zhang
Matching extension in quadrangulations of the torus. Australas. J Comb. 57 (2013)
Jun Fujisawa, Michael D. Plummer, Akira Saito
Forbidden subgraphs generating a finite set. Discret. Math. 313 (19) (2013)
Robert E. L. Aldred, Michael D. Plummer
Graphs with the cycle extension property. Australas. J Comb. 52 (2012)
Mark N. Ellingham, Michael D. Plummer, Gexin Yu
Linkage for the diamond and the path with four vertices. J. Graph Theory 70 (3) (2012)
Robert E. L. Aldred, Michael D. Plummer
Proximity thresholds for matching extension in the torus and Klein bottle. Discret. Appl. Math. 160 (7-8) (2012)
Robert E. L. Aldred, Michael D. Plummer
Proximity thresholds for matching extension in planar and projective planar triangulations. J. Graph Theory 67 (1) (2011)
Katsuhiro Ota, Michael D. Plummer, Akira Saito
Forbidden triples for perfect matchings. J. Graph Theory 67 (3) (2011)
Donald Nelson, Michael D. Plummer, Neil Robertson, Xiaoya Zha
On a Conjecture Concerning the Petersen Graph. Electron. J. Comb. 18 (1) (2011)
Ken-ichi Kawarabayashi, Seiya Negami, Michael D. Plummer, Yusuke Suzuki
The 2-extendability of 5-connected graphs on surfaces with large representativity. J. Comb. Theory, Ser. B 101 (4) (2011)
Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. Comb. 31 (6) (2011)
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
On well-covered triangulations: Part III. Discret. Appl. Math. 158 (8) (2010)
Robert E. L. Aldred, Michael D. Plummer
Distance-restricted matching extension in planar triangulations. Discret. Math. 310 (20) (2010)
Ken-ichi Kawarabayashi, Michael D. Plummer
A note on traversing specified vertices in graphs embedded with large representativity. Discret. Math. 310 (20) (2010)
Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
On well-covered triangulations: Part II. Discret. Appl. Math. 157 (13) (2009)
Ken-ichi Kawarabayashi, Michael D. Plummer
Bounding the Size of Equimatchable Graphs of Fixed Genus. Graphs Comb. 25 (1) (2009)
Michael D. Plummer, Xiaoya Zha
On certain spanning subgraphs of embeddings with applications to domination. Discret. Math. 309 (14) (2009)
Robert E. L. Aldred, Michael D. Plummer
Restricted matching in graphs of small genus. Discret. Math. 308 (24) (2008)
Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer
Matching properties in connected domination critical graphs. Discret. Math. 308 (7) (2008)
Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer
On the matching extendability of graphs in surfaces. J. Comb. Theory, Ser. B 98 (1) (2008)
Michael D. Plummer
On the Structure of Graphs Vertex Critical with Respect to Connected Domination. Bonn Workshop of Combinatorial Optimization (2008)
Michael D. Plummer
Graph factors and factorization: 1985-2003: A survey. Discret. Math. 307 (7-8) (2007)
Nawarat Ananchuen, Michael D. Plummer
Matchings in 3-vertex-critical graphs: The odd case. Discret. Math. 307 (13) (2007)
Nawarat Ananchuen, Michael D. Plummer
3-Factor-criticality in domination critical graphs. Discret. Math. 307 (23) (2007)
Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
Domination in a graph with a 2-factor. J. Graph Theory 52 (1) (2006)
Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
A pair of forbidden subgraphs and perfect matchings. J. Comb. Theory, Ser. B 96 (3) (2006)
Nawarat Ananchuen, Michael D. Plummer
Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. Discret. Math. 306 (2) (2006)
Nawarat Ananchuen, Michael D. Plummer
Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15]. Discret. Math. 306 (2) (2006)
Michael D. Plummer
Some recent results on domination in graphs. Discuss. Math. Graph Theory 26 (3) (2006)
Michael A. Henning, Michael D. Plummer
Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. J. Comb. Optim. 10 (3) (2005)
Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture. J. Comb. Theory, Ser. B 95 (1) (2005)
Nawarat Ananchuen, Michael D. Plummer
Matchings in 3-vertex-critical graphs: The even case. Networks 45 (4) (2005)
Michael D. Plummer, Akira Saito
Forbidden subgraphs and bounds on the size of a maximum matching. J. Graph Theory 50 (1) (2005)
Robert E. L. Aldred, Michael D. Plummer
Edge proximity and matching extension in planar triangulations. Australas. J Comb. 29 (2004)
Michael D. Plummer, Xiaoya Zha
-factor-criticality of the Klein bottle. Discret. Math. 287 (1-3) (2004)
Nawarat Ananchuen, Michael D. Plummer
Matching properties in domination critical graphs. Discret. Math. 277 (1-3) (2004)
Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
On two equimatchable graph classes. Discret. Math. 266 (1-3) (2003)
Nawarat Ananchuen, Michael D. Plummer
Some results related to the toughness of 3-domination critical graphs. Discret. Math. 272 (1) (2003)
Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
On well-covered triangulations: Part I. Discret. Appl. Math. 132 (1-3) (2003)
Michael D. Plummer, Michael Stiebitz, Bjarne Toft
On a special case of Hadwiger's conjecture. Discuss. Math. Graph Theory 23 (2) (2003)
Michael D. Plummer, Xiaoya Zha
On the Connectivity of Graphs Embedded in Surfaces II. Electron. J. Comb. 9 (1) (2002)
Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha
Isoperimetric Constants of Infinite Plane Graphs. Discret. Comput. Geom. 28 (3) (2002)
Michael D. Plummer, Xiaoya Zha
Genus bounds for embeddings with large minimum degree and representativity. Discret. Math. 249 (1-3) (2002)
Robert E. L. Aldred, Michael D. Plummer
On restricted matching extension in planar graphs. Discret. Math. 231 (1-3) (2001)
Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha
Bounds for isoperimetric constants of infinite plane graphs. Discret. Appl. Math. 113 (2-3) (2001)
Michael D. Plummer, Akira Saito
Closure and factor-critical graphs. Discret. Math. 215 (2000)
Robert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer
Two results on matching extensions with prescribed and proscribed edge sets. Discret. Math. 206 (1-3) (1999)
Robert E. L. Aldred, Michael D. Plummer
On matching extensions with prescribed and proscribed edge sets II. Discret. Math. (1999)
Hikoe Enomoto, Michael D. Plummer, Akira Saito
Neighborhood unions and factor critical graphs. Discret. Math. 205 (1-3) (1999)
Michael D. Plummer, Xiaoya Zha
On the Connectivity of Graphs Embedded in Surfaces. J. Comb. Theory, Ser. B 72 (2) (1998)
Wayne Goddard, Michael D. Plummer, Henda C. Swart
Maximum and minimum toughness of graphs of small genus. Discret. Math. (1997)
Michael D. Plummer
Extending matchings in planar graphs V. Discret. Math. 150 (1-3) (1996)
Bert L. Hartnell, Michael D. Plummer
On 4-connected Claw-free Well-covered Graphs. Discret. Appl. Math. 64 (1) (1996)
Michael D. Plummer
Extending matchings in graphs: A survey. Discret. Math. 127 (1-3) (1994)
Michael D. Plummer
Extending matchings in claw-free graphs. Discret. Math. 125 (1-3) (1994)
Michael D. Plummer
Extending matchings in planar graphs IV. Discret. Math. 109 (1-3) (1992)
Ervin Györi, Michael D. Plummer
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. Discret. Math. 101 (1-3) (1992)
Michael D. Plummer
Matching theory - a sampler: from Dénes König to the present. Discret. Math. 100 (1-3) (1992)
Derek A. Holton, Dingjun Lou, Michael D. Plummer
On the 2-extendability of planar graphs. Discret. Math. 96 (2) (1991)
Michael D. Plummer
Matching extension and the genus of a graph. J. Comb. Theory, Ser. B 44 (3) (1988)
Michael D. Plummer
Toughness and matching extension in graphs. Discret. Math. 72 (1-3) (1988)
Michael D. Plummer, Bjarne Toft
Cyclic coloration of 3-polytopes. J. Graph Theory 11 (4) (1987)
Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen
A nine point theorem for 3-connected graphs. Comb. 2 (1) (1982)
Michael D. Plummer
On n-extendable graphs. Discret. Math. 31 (2) (1980)
László Lovász, Michael D. Plummer
On minimal elementary bipartite graphs. J. Comb. Theory, Ser. B 23 (1) (1977)
Michael D. Plummer, Neil Robertson
Path traversability in planar graphs. Discret. Math. 7 (3-4) (1974)