 | 2009 |
|---|
| 44 |       | Art S. Finbow,
Bert Hartnell,
Richard J. Nowakowski,
Michael D. Plummer:
On well-covered triangulations: Part II.
Discrete Applied Mathematics 157(13): 2799-2817 (2009) |
| 2008 |
|---|
| 43 | | Robert E. L. Aldred,
Michael D. Plummer:
Restricted matching in graphs of small genus.
Discrete Mathematics 308(24): 5907-5921 (2008) |
| 42 | | Nawarat Ananchuen,
Watcharaphong Ananchuen,
Michael D. Plummer:
Matching properties in connected domination critical graphs.
Discrete Mathematics 308(7): 1260-1267 (2008) |
| 41 | | 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): 105-115 (2008) |
| 2007 |
|---|
| 40 | | Nawarat Ananchuen,
Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The odd case.
Discrete Mathematics 307(13): 1651-1658 (2007) |
| 39 | | Nawarat Ananchuen,
Michael D. Plummer:
3-Factor-criticality in domination critical graphs.
Discrete Mathematics 307(23): 3006-3015 (2007) |
| 38 | | Michael D. Plummer:
Graph factors and factorization: 1985-2003: A survey.
Discrete Mathematics 307(7-8): 791-821 (2007) |
| 2006 |
|---|
| 37 | | Nawarat Ananchuen,
Michael D. Plummer:
Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13].
Discrete Mathematics 306(2): 291 (2006) |
| 36 | | 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 306(2): 292 (2006) |
| 35 | | 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): 315-324 (2006) |
| 34 | | Ken-ichi Kawarabayashi,
Michael D. Plummer,
Akira Saito:
Domination in a graph with a 2-factor.
Journal of Graph Theory 52(1): 1-6 (2006) |
| 2005 |
|---|
| 33 | | Michael D. Henning,
Michael D. Plummer:
Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree.
J. Comb. Optim. 10(3): 283-294 (2005) |
| 32 | | 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): 152-167 (2005) |
| 31 | | Michael D. Plummer,
Akira Saito:
Forbidden subgraphs and bounds on the size of a maximum matching.
Journal of Graph Theory 50(1): 1-12 (2005) |
| 30 | | Nawarat Ananchuen,
Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The even case.
Networks 45(4): 210-213 (2005) |
| 2004 |
|---|
| 29 | | Nawarat Ananchuen,
Michael D. Plummer:
Matching properties in domination critical graphs.
Discrete Mathematics 277(1-3): 1-13 (2004) |
| 28 | | Michael D. Plummer,
Xiaoya Zha:
On the p-factor-criticality of the Klein bottle.
Discrete Mathematics 287(1-3): 171-175 (2004) |
| 2003 |
|---|
| 27 | | Art S. Finbow,
Bert Hartnell,
Richard J. Nowakowski,
Michael D. Plummer:
On well-covered triangulations: Part I.
Discrete Applied Mathematics 132(1-3): 97-108 (2003) |
| 26 | | Ken-ichi Kawarabayashi,
Michael D. Plummer,
Akira Saito:
On two equimatchable graph classes.
Discrete Mathematics 266(1-3): 263-274 (2003) |
| 25 | | Nawarat Ananchuen,
Michael D. Plummer:
Some results related to the toughness of 3-domination critical graphs.
Discrete Mathematics 272(1): 5-15 (2003) |
| 2002 |
|---|
| 24 | | Serge Lawrencenko,
Michael D. Plummer,
Xiaoya Zha:
Isoperimetric Constants of Infinite Plane Graphs.
Discrete & Computational Geometry 28(3): 313-330 (2002) |
| 23 | | Michael D. Plummer,
Xiaoya Zha:
Genus bounds for embeddings with large minimum degree and representativity.
Discrete Mathematics 249(1-3): 167-178 (2002) |
| 22 | | Michael D. Plummer,
Xiaoya Zha:
On the Connectivity of Graphs Embedded in Surfaces II.
Electr. J. Comb. 9(1): (2002) |
| 2001 |
|---|
| 21 |  | Serge Lawrencenko,
Michael D. Plummer,
Xiaoya Zha:
Bounds for isoperimetric constants of infinite plane graphs.
Discrete Applied Mathematics 113(2-3): 237-241 (2001) |
| 20 | | Robert E. L. Aldred,
Michael D. Plummer:
On restricted matching extension in planar graphs.
Discrete Mathematics 231(1-3): 73-79 (2001) |
| 2000 |
|---|
| 19 | | Michael D. Plummer,
Akira Saito:
Closure and factor-critical graphs.
Discrete Mathematics 215: 171-179 (2000) |
| 1999 |
|---|
| 18 | | Robert E. L. Aldred,
Michael D. Plummer:
On matching extensions with prescribed and proscribed edge sets II.
Discrete Mathematics 197-198: 29-40 (1999) |
| 17 | | Hikoe Enomoto,
Michael D. Plummer,
Akira Saito:
Neighborhood unions and factor critical graphs.
Discrete Mathematics 205(1-3): 217-220 (1999) |
| 16 | | 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 206(1-3): 35-43 (1999) |
| 1998 |
|---|
| 15 | | Michael D. Plummer,
Xiaoya Zha:
On the Connectivity of Graphs Embedded in Surfaces.
J. Comb. Theory, Ser. B 72(2): 208-228 (1998) |
| 1997 |
|---|
| 14 | | Wayne Goddard,
Michael D. Plummer,
Henda C. Swart:
Maximum and minimum toughness of graphs of small genus.
Discrete Mathematics 167-168: 329-339 (1997) |
| 1996 |
|---|
| 13 | | Bert Hartnell,
Michael D. Plummer:
On 4-connected Claw-free Well-covered Graphs.
Discrete Applied Mathematics 64(1): 57-65 (1996) |
| 12 | | Michael D. Plummer:
Extending matchings in planar graphs V.
Discrete Mathematics 150(1-3): 315-324 (1996) |
| 1994 |
|---|
| 11 | | Michael D. Plummer:
Extending matchings in claw-free graphs.
Discrete Mathematics 125(1-3): 301-307 (1994) |
| 10 | | Michael D. Plummer:
Extending matchings in graphs: A survey.
Discrete Mathematics 127(1-3): 277-292 (1994) |
| 1992 |
|---|
| 9 | | Michael D. Plummer:
Matching theory - a sampler: from Dénes König to the present.
Discrete Mathematics 100(1-3): 177-219 (1992) |
| 8 | | 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 101(1-3): 87-96 (1992) |
| 7 | | Michael D. Plummer:
Extending matchings in planar graphs IV.
Discrete Mathematics 109(1-3): 207-219 (1992) |
| 1991 |
|---|
| 6 | | Derek A. Holton,
Dingjun Lou,
Michael D. Plummer:
On the 2-extendability of planar graphs.
Discrete Mathematics 96(2): 81-99 (1991) |
| 1988 |
|---|
| 5 | | Michael D. Plummer:
Toughness and matching extension in graphs.
Discrete Mathematics 72(1-3): 311-320 (1988) |
| 4 | | Michael D. Plummer:
Matching extension and the genus of a graph.
J. Comb. Theory, Ser. B 44(3): 329-337 (1988) |
| 1982 |
|---|
| 3 | | Derek A. Holton,
Brendan D. McKay,
Michael D. Plummer,
Carsten Thomassen:
A nine point theorem for 3-connected graphs.
Combinatorica 2(1): 53-62 (1982) |
| 1980 |
|---|
| 2 | | Michael D. Plummer:
On n-extendable graphs.
Discrete Mathematics 31(2): 201-210 (1980) |
| 1977 |
|---|
| 1 | | László Lovász,
Michael D. Plummer:
On minimal elementary bipartite graphs.
J. Comb. Theory, Ser. B 23(1): 127-138 (1977) |
