Michael D. Plummer

Orcid: 0000-0002-5877-5330

According to our database1, Michael D. Plummer authored at least 88 papers between 1974 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Edge proximity conditions for extendability in regular bipartite graphs.
J. Graph Theory, October, 2023

2022
A characterization of well-indumatchable graphs having girth greater than seven.
Discret. Appl. Math., 2022

2021
Asymmetric distance matching extension.
Australas. J Comb., 2021

2020
Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane.
J. Graph Theory, 2020

Extendability and Criticality in Matching Theory.
Graphs Comb., 2020

Dominating maximal outerplane graphs and Hamiltonian plane triangulations.
Discret. Appl. Math., 2020

On the structure of 4-regular planar well-covered graphs.
Discret. Appl. Math., 2020

Restricted matching in plane triangulations and near triangulations.
Discret. Appl. Math., 2020

Cycle Traversability for Claw-Free Graphs and Polyhedral Maps.
Comb., 2020

2017
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces.
J. Graph Theory, 2017

Toughness, binding number and restricted matching extension in a graph.
Discret. Math., 2017

Connectivity and W<sub>v</sub> -Paths in Polyhedral Maps on Surfaces.
Discret. Comput. Geom., 2017

On well-covered pentagonalizations of the plane.
Discret. Appl. Math., 2017

Matching extension in prism graphs.
Discret. Appl. Math., 2017

2016
Dominating plane triangulations.
Discret. Appl. Math., 2016

Well-covered triangulations: Part IV.
Discret. Appl. Math., 2016

2015
Perfect matchings avoiding prescribed edges in a star-free graph.
Discret. Math., 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.
Electron. J. Comb., 2015

Matching extension in toroidal quadrangulations II: the 3-extendable case.
Australas. J Comb., 2015

2014
A Note on Cyclic Connectivity and Matching Properties of Regular Graphs.
Graphs Comb., 2014

A note on graphs contraction-critical with respect to independence number.
Discret. Math., 2014

On a Conjecture Concerning the Petersen Graph: Part II.
Electron. J. Comb., 2014

2013
Forbidden subgraphs generating a finite set.
Discret. Math., 2013

Matching extension in quadrangulations of the torus.
Australas. J Comb., 2013

2012
Linkage for the diamond and the path with four vertices.
J. Graph Theory, 2012

Proximity thresholds for matching extension in the torus and Klein bottle.
Discret. Appl. Math., 2012

Graphs with the cycle extension property.
Australas. J Comb., 2012

2011
Forbidden triples for perfect matchings.
J. Graph Theory, 2011

Proximity thresholds for matching extension in planar and projective planar triangulations.
J. Graph Theory, 2011

The 2-extendability of 5-connected graphs on surfaces with large representativity.
J. Comb. Theory B, 2011

On a Conjecture Concerning the Petersen Graph.
Electron. J. Comb., 2011

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.
Comb., 2011

Domination in Graphs.
Proceedings of the Structural Analysis of Complex Networks, 2011

2010
A note on traversing specified vertices in graphs embedded with large representativity.
Discret. Math., 2010

Distance-restricted matching extension in planar triangulations.
Discret. Math., 2010

On well-covered triangulations: Part III.
Discret. Appl. Math., 2010

2009
Bounding the Size of Equimatchable Graphs of Fixed Genus.
Graphs Comb., 2009

On certain spanning subgraphs of embeddings with applications to domination.
Discret. Math., 2009

On well-covered triangulations: Part II.
Discret. Appl. Math., 2009

2008
On the matching extendability of graphs in surfaces.
J. Comb. Theory B, 2008

Matching properties in connected domination critical graphs.
Discret. Math., 2008

Restricted matching in graphs of small genus.
Discret. Math., 2008

On the Structure of Graphs Vertex Critical with Respect to Connected Domination.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007
Graph factors and factorization: 1985-2003: A survey.
Discret. Math., 2007

3-Factor-criticality in domination critical graphs.
Discret. Math., 2007

Matchings in 3-vertex-critical graphs: The odd case.
Discret. Math., 2007

2006
Domination in a graph with a 2-factor.
J. Graph Theory, 2006

A pair of forbidden subgraphs and perfect matchings.
J. Comb. Theory B, 2006

Some recent results on domination in graphs.
Discuss. Math. Graph Theory, 2006

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

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

2005
Matchings in 3-vertex-critical graphs: The even case.
Networks, 2005

Forbidden subgraphs and bounds on the size of a maximum matching.
J. Graph Theory, 2005

Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture.
J. Comb. Theory B, 2005

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree.
J. Comb. Optim., 2005

2004
On the <i>p</i>-factor-criticality of the Klein bottle.
Discret. Math., 2004

Matching properties in domination critical graphs.
Discret. Math., 2004

Edge proximity and matching extension in planar triangulations.
Australas. J Comb., 2004

2003
On a special case of Hadwiger's conjecture.
Discuss. Math. Graph Theory, 2003

On two equimatchable graph classes.
Discret. Math., 2003

Some results related to the toughness of 3-domination critical graphs.
Discret. Math., 2003

On well-covered triangulations: Part I.
Discret. Appl. Math., 2003

2002
Genus bounds for embeddings with large minimum degree and representativity.
Discret. Math., 2002

Isoperimetric Constants of Infinite Plane Graphs.
Discret. Comput. Geom., 2002

On the Connectivity of Graphs Embedded in Surfaces II.
Electron. J. Comb., 2002

2001
On restricted matching extension in planar graphs.
Discret. Math., 2001

Bounds for isoperimetric constants of infinite plane graphs.
Discret. Appl. Math., 2001

2000
Closure and factor-critical graphs.
Discret. Math., 2000

1999
Neighborhood unions and factor critical graphs.
Discret. Math., 1999

On matching extensions with prescribed and proscribed edge sets II.
Discret. Math., 1999

Two results on matching extensions with prescribed and proscribed edge sets.
Discret. Math., 1999

1998
On the Connectivity of Graphs Embedded in Surfaces.
J. Comb. Theory B, 1998

1997
Maximum and minimum toughness of graphs of small genus.
Discret. Math., 1997

1996
Extending matchings in planar graphs V.
Discret. Math., 1996

On 4-connected Claw-free Well-covered Graphs.
Discret. Appl. Math., 1996

1994
Extending matchings in graphs: A survey.
Discret. Math., 1994

Extending matchings in claw-free graphs.
Discret. Math., 1994

1992
Extending matchings in planar graphs IV.
Discret. Math., 1992

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

The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable.
Discret. Math., 1992

1991
On the 2-extendability of planar graphs.
Discret. Math., 1991

1988
Matching extension and the genus of a graph.
J. Comb. Theory B, 1988

Toughness and matching extension in graphs.
Discret. Math., 1988

1987
Cyclic coloration of 3-polytopes.
J. Graph Theory, 1987

1982
A nine point theorem for 3-connected graphs.
Comb., 1982

1980
On n-extendable graphs.
Discret. Math., 1980

1977
On minimal elementary bipartite graphs.
J. Comb. Theory B, 1977

1974
Path traversability in planar graphs.
Discret. Math., 1974


  Loading...