| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Robert E. L. Aldred, Michael D. Plummer |
Proximity thresholds for matching extension in the torus and Klein bottle.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald Nelson, Michael D. Plummer, Neil Robertson, Xiaoya Zha |
On a Conjecture Concerning the Petersen Graph. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer |
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Katsuhiro Ota, Michael D. Plummer, Akira Saito |
Forbidden triples for perfect matchings. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Michael D. Plummer |
Proximity thresholds for matching extension in planar and projective planar triangulations. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Michael D. Plummer |
A note on traversing specified vertices in graphs embedded with large representativity. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Michael D. Plummer |
Distance-restricted matching extension in planar triangulations. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer |
On well-covered triangulations: Part III. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Xiaoya Zha |
On certain spanning subgraphs of embeddings with applications to domination. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Michael D. Plummer |
Bounding the Size of Equimatchable Graphs of Fixed Genus. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer |
On well-covered triangulations: Part II. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer |
On the matching extendability of graphs in surfaces. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer |
Matching properties in connected domination critical graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Michael D. Plummer |
Restricted matching in graphs of small genus. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nawarat Ananchuen, Michael D. Plummer |
Matchings in 3-vertex-critical graphs: The odd case. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Graph factors and factorization: 1985-2003: A survey. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nawarat Ananchuen, Michael D. Plummer |
3-Factor-criticality in domination critical graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nawarat Ananchuen, Michael D. Plummer |
Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15]. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nawarat Ananchuen, Michael D. Plummer |
Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Some recent results on domination in graphs. |
Discussiones Mathematicae Graph Theory |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito |
Domination in a graph with a 2-factor. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Henning, Michael D. Plummer |
Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
paired-domination number, tree |
| 1 | Nawarat Ananchuen, Michael D. Plummer |
Matchings in 3-vertex-critical graphs: The even case. |
Networks |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Akira Saito |
Forbidden subgraphs and bounds on the size of a maximum matching. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nawarat Ananchuen, Michael D. Plummer |
Matching properties in domination critical graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Xiaoya Zha |
On the p-factor-criticality of the Klein bottle. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito |
On two equimatchable graph classes. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nawarat Ananchuen, Michael D. Plummer |
Some results related to the toughness of 3-domination critical graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer |
On well-covered triangulations: Part I. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Xiaoya Zha |
Genus bounds for embeddings with large minimum degree and representativity. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Xiaoya Zha |
On the Connectivity of Graphs Embedded in Surfaces II. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha |
Isoperimetric Constants of Infinite Plane Graphs. |
Discrete & Computational Geometry |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Michael D. Plummer |
On restricted matching extension in planar graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha |
Bounds for isoperimetric constants of infinite plane graphs. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Akira Saito |
Closure and factor-critical graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hikoe Enomoto, Michael D. Plummer, Akira Saito |
Neighborhood unions and factor critical graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Michael D. Plummer |
On matching extensions with prescribed and proscribed edge sets II. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer |
Two results on matching extensions with prescribed and proscribed edge sets. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Xiaoya Zha |
On the Connectivity of Graphs Embedded in Surfaces. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Michael D. Plummer, Henda C. Swart |
Maximum and minimum toughness of graphs of small genus. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Extending matchings in planar graphs V. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Hartnell, Michael D. Plummer |
On 4-connected Claw-free Well-covered Graphs. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Extending matchings in claw-free graphs. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Extending matchings in graphs: A survey. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ervin Györi, Michael D. Plummer |
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Extending matchings in planar graphs IV. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Matching theory - a sampler: from Dénes König to the present. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek A. Holton, Dingjun Lou, Michael D. Plummer |
On the 2-extendability of planar graphs. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Matching extension and the genus of a graph. |
J. Comb. Theory, Ser. B |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
Toughness and matching extension in graphs. |
Discrete Mathematics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen |
A nine point theorem for 3-connected graphs. |
Combinatorica |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer |
On n-extendable graphs. |
Discrete Mathematics |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Michael D. Plummer |
On minimal elementary bipartite graphs. |
J. Comb. Theory, Ser. B |
1977 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")