Michael D. Plummer

From MaRDI portal
Person:189707

Available identifiers

zbMath Open plummer.michael-dWikidataQ14492078 ScholiaQ14492078MaRDI QIDQ189707

List of research outcomes

PublicationDate of PublicationType
Edge proximity conditions for extendability in regular bipartite graphs2023-10-09Paper
A characterization of well-indumatchable graphs having girth greater than seven2022-09-15Paper
Distance restricted matching extension missing vertices and edges in 5‐connected triangulations of the plane2022-03-31Paper
https://portal.mardi4nfdi.de/entity/Q49901022021-05-28Paper
Cycle traversability for claw-free graphs and polyhedral maps2020-12-18Paper
Restricted matching in plane triangulations and near triangulations2020-07-07Paper
On the structure of 4-regular planar well-covered graphs2020-06-29Paper
Dominating maximal outerplane graphs and Hamiltonian plane triangulations2020-06-05Paper
Extendability and criticality in matching theory2020-04-30Paper
https://portal.mardi4nfdi.de/entity/Q46359702018-04-23Paper
Connectivity and \(W_v\)-paths in polyhedral maps on surfaces2017-10-10Paper
Toughness, binding number and restricted matching extension in a graph2017-09-05Paper
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces2017-06-30Paper
On well-covered pentagonalizations of the plane2017-05-15Paper
On the Structure of Graphs Vertex Critical with Respect to Connected Domination2017-04-07Paper
Matching extension in prism graphs2017-02-27Paper
Dominating plane triangulations2016-11-02Paper
Well-covered triangulations. IV2016-10-07Paper
Inflations of anti-cycles and Hadwiger's conjecture2016-05-25Paper
Distance matching in punctured planar triangulations2016-05-25Paper
https://portal.mardi4nfdi.de/entity/Q34514582015-11-16Paper
Forbidden triples generating a finite set of 3-connected graphs2015-08-27Paper
Perfect matchings avoiding prescribed edges in a star-free graph2015-08-05Paper
A note on cyclic connectivity and matching properties of regular graphs2014-09-19Paper
On a conjecture concerning the Petersen graph. II2014-09-04Paper
A note on graphs contraction-critical with respect to independence number2014-05-06Paper
https://portal.mardi4nfdi.de/entity/Q28666152013-12-13Paper
Forbidden subgraphs generating a finite set2013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28396722013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q52989202013-06-25Paper
https://portal.mardi4nfdi.de/entity/Q31661182012-10-21Paper
Linkage for the diamond and the path with four vertices2012-07-10Paper
https://portal.mardi4nfdi.de/entity/Q28953672012-07-02Paper
Proximity thresholds for matching extension in the torus and Klein bottle2012-05-30Paper
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity2012-04-26Paper
Forbidden triples for perfect matchings2011-07-21Paper
The 2-extendability of 5-connected graphs on surfaces with large representativity2011-05-19Paper
Proximity thresholds for matching extension in planar and projective planar triangulations2011-05-11Paper
Domination in Graphs2010-12-21Paper
Distance-restricted matching extension in planar triangulations2010-10-18Paper
A note on traversing specified vertices in graphs embedded with large representativity2010-10-18Paper
On well-covered triangulations. III2010-05-25Paper
On well-covered triangulations. II.2010-04-28Paper
On certain spanning subgraphs of embeddings with applications to domination2009-12-15Paper
Bounding the size of equimatchable graphs of fixed genus2009-12-09Paper
https://portal.mardi4nfdi.de/entity/Q33955072009-09-03Paper
Minimal claw-free graphs2009-05-06Paper
https://portal.mardi4nfdi.de/entity/Q36157962009-03-24Paper
Recent Progress in Matching Extension2009-02-12Paper
Restricted matching in graphs of small genus2009-01-28Paper
Matching properties in connected domination critical graphs2008-02-11Paper
Some recent results on domination in graphs2008-01-18Paper
On the matching extendability of graphs in surfaces2007-12-10Paper
3-factor-criticality in domination critical graphs2007-11-30Paper
Vertices contained in all or in no minimum paired-dominating set of a tree2007-09-10Paper
Matchings in 3-vertex-critical graphs: the odd case2007-05-11Paper
Graph factors and factorization: 1985--2003: a survey2007-03-02Paper
https://portal.mardi4nfdi.de/entity/Q34135062006-12-12Paper
https://portal.mardi4nfdi.de/entity/Q54883342006-09-14Paper
Domination in a graph with a 2‐factor2006-06-06Paper
A pair of forbidden subgraphs and perfect matchings.2006-05-18Paper
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture2005-09-28Paper
Forbidden subgraphs and bounds on the size of a maximum matching2005-09-22Paper
Matchings in 3‐vertex‐critical graphs: The even case2005-08-05Paper
On the \(p\)-factor-criticality of the Klein bottle2004-11-18Paper
On a special case of Hadwiger's conjecture2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48207802004-10-01Paper
Matching properties in domination critical graphs.2004-03-14Paper
On well-covered triangulations. I2003-12-04Paper
Some results related to the toughness of 3-domination critical graphs2003-12-04Paper
On two equimatchable graph classes2003-06-09Paper
Isoperimetric constants of infinite plane graphs2002-12-01Paper
A nine vertex theorem for 3-connected claw- free graphs2002-11-03Paper
On the connectivity of graphs embedded in surfaces. II2002-09-29Paper
Bounds for isoperimetric constants of infinite plane graphs2002-06-03Paper
Genus bounds for embeddings with large minimum degree and representativity2002-05-28Paper
On restricted matching extension in planar graphs2001-11-28Paper
Closure and factor-critical graphs2000-12-13Paper
Neighborhood unions and factor critical graphs2000-04-09Paper
Two results on matching extensions with prescribed and proscribed edge sets2000-01-27Paper
On matching extensions with prescribed and proscribed edge sets. II2000-01-25Paper
https://portal.mardi4nfdi.de/entity/Q42282131999-08-31Paper
On the connectivity of graphs embedded in surfaces1999-07-05Paper
https://portal.mardi4nfdi.de/entity/Q43932331998-09-28Paper
https://portal.mardi4nfdi.de/entity/Q43906541998-08-31Paper
Maximum and minimum toughness of graphs of small genus1997-06-09Paper
On 4-connected claw-free well-covered graphs1997-04-07Paper
Extending matchings in planar graphs. V1996-07-02Paper
https://portal.mardi4nfdi.de/entity/Q48737441996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48710531996-03-28Paper
https://portal.mardi4nfdi.de/entity/Q43043971994-12-01Paper
https://portal.mardi4nfdi.de/entity/Q31397701994-11-29Paper
Extending matchings in graphs: A survey1994-10-20Paper
Extending matchings in claw-free graphs1994-10-20Paper
https://portal.mardi4nfdi.de/entity/Q42946161994-05-17Paper
WELL-COVERED GRAPHS: A SURVEY1994-04-21Paper
Corrigendum to: ``On the 2-extendability of planar graphs, Discrete Mathematics 96 (1991) 81-991993-12-15Paper
Extending matchings in planar graphs. IV1993-10-14Paper
The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable1993-01-16Paper
Matching theory -- a sampler: From Dénes König to the present1993-01-16Paper
On the 2-extendability of planar graphs1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39766371992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39725231992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47114901992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34691321990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47324911989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47298331988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52022071988-01-01Paper
Matching extension and the genus of a graph1988-01-01Paper
Toughness and matching extension in graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30270421987-01-01Paper
Cyclic coloration of 3-polytopes1987-01-01Paper
Matching theory1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38000931986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33408961984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808621984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39675681982-01-01Paper
A nine point theorem for 3-connected graphs1982-01-01Paper
Cycles Through Prescribed and Forbidden Point Sets1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39569791982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39675591982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39328301981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367691981-01-01Paper
On n-extendable graphs1980-01-01Paper
Mengerian theorems for paths of bounded length1978-01-01Paper
On minimal elementary bipartite graphs1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41001161976-01-01Paper
On a Family of Planar Bicritical Graphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40655871975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40536901974-01-01Paper
Path traversability in planar graphs1974-01-01Paper
On Cycles and Connectivity in Planar Graphs1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595601972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56775111972-01-01Paper
A family of path properties for graphs1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40460771971-01-01Paper
Some covering concepts in graphs1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55913781969-01-01Paper
On Minimal Blocks1968-01-01Paper
On the 1-factors of a non-separable graph1967-01-01Paper
On the Core of a Graph1967-01-01Paper
On Indecomposable Graphs1967-01-01Paper
On the critical lines of a graph1967-01-01Paper
On a family of line-critical graphs1967-01-01Paper
On the point-core of a graph1966-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Michael D. Plummer