Michael D. Plummer

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