default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael D. Plummer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j86]Robert E. L. Aldred
, Bill Jackson, Michael D. Plummer:
Edge proximity conditions for extendability in regular bipartite graphs. J. Graph Theory 104(2): 282-288 (2023)- 2022
- [j85]Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer:
A characterization of well-indumatchable graphs having girth greater than seven. Discret. Appl. Math. 321: 261-271 (2022) - 2021
- [j84]Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Asymmetric distance matching extension. Australas. J Comb. 79: 1-14 (2021) - 2020
- [j83]Ervin Györi, Michael D. Plummer, Dong Ye, Xiaoya Zha:
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. Comb. 40(3): 405-433 (2020) - [j82]Michael D. Plummer, Dong Ye, Xiaoya Zha:
Dominating maximal outerplane graphs and Hamiltonian plane triangulations. Discret. Appl. Math. 282: 162-167 (2020) - [j81]Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer:
On the structure of 4-regular planar well-covered graphs. Discret. Appl. Math. 283: 655-688 (2020) - [j80]Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Restricted matching in plane triangulations and near triangulations. Discret. Appl. Math. 284: 251-261 (2020) - [j79]Robert E. L. Aldred, Michael D. Plummer:
Extendability and Criticality in Matching Theory. Graphs Comb. 36(3): 573-589 (2020) - [j78]Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane. J. Graph Theory 95(2): 240-255 (2020)
2010 – 2019
- 2017
- [j77]Robert E. L. Aldred, Michael D. Plummer:
Matching extension in prism graphs. Discret. Appl. Math. 221: 25-32 (2017) - [j76]Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer:
On well-covered pentagonalizations of the plane. Discret. Appl. Math. 224: 91-105 (2017) - [j75]Michael D. Plummer, Dong Ye, Xiaoya Zha:
Connectivity and Wv -Paths in Polyhedral Maps on Surfaces. Discret. Comput. Geom. 58(1): 217-231 (2017) - [j74]Michael D. Plummer, Akira Saito:
Toughness, binding number and restricted matching extension in a graph. Discret. Math. 340(11): 2665-2672 (2017) - [j73]Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer:
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. J. Graph Theory 85(1): 249-257 (2017) - 2016
- [j72]Michael D. Plummer, Dong Ye, Xiaoya Zha:
Dominating plane triangulations. Discret. Appl. Math. 211: 175-182 (2016) - [j71]Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
Well-covered triangulations: Part IV. Discret. Appl. Math. 215: 71-94 (2016) - 2015
- [j70]Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Dong Ye, Heping Zhang:
Matching extension in toroidal quadrangulations II: the 3-extendable case. Australas. J Comb. 63: 268-296 (2015) - [j69]Yoshimi Egawa, Jun Fujisawa, Michitaka Furuya, Michael D. Plummer, Akira Saito:
Forbidden Triples Generating a Finite set of 3-Connected Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j68]Yoshimi Egawa, Jun Fujisawa, Michael D. Plummer, Akira Saito, Tomoki Yamashita:
Perfect matchings avoiding prescribed edges in a star-free graph. Discret. Math. 338(12): 2260-2274 (2015) - 2014
- [j67]Michael D. Plummer, Xiaoya Zha:
On a Conjecture Concerning the Petersen Graph: Part II. Electron. J. Comb. 21(1): 1 (2014) - [j66]Michael D. Plummer, Akira Saito:
A note on graphs contraction-critical with respect to independence number. Discret. Math. 325: 85-91 (2014) - [j65]Michael D. Plummer, Tao Wang, Qinglin Yu:
A Note on Cyclic Connectivity and Matching Properties of Regular Graphs. Graphs Comb. 30(4): 1003-1011 (2014) - 2013
- [j64]Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Heping Zhang:
Matching extension in quadrangulations of the torus. Australas. J Comb. 57: 217-234 (2013) - [j63]Jun Fujisawa, Michael D. Plummer, Akira Saito:
Forbidden subgraphs generating a finite set. Discret. Math. 313(19): 1835-1842 (2013) - 2012
- [j62]Robert E. L. Aldred, Michael D. Plummer:
Graphs with the cycle extension property. Australas. J Comb. 52: 293- (2012) - [j61]Robert E. L. Aldred, Michael D. Plummer:
Proximity thresholds for matching extension in the torus and Klein bottle. Discret. Appl. Math. 160(7-8): 985-991 (2012) - [j60]Mark N. Ellingham, Michael D. Plummer, Gexin Yu:
Linkage for the diamond and the path with four vertices. J. Graph Theory 70(3): 241-261 (2012) - 2011
- [j59]Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer:
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. Comb. 31(6): 703-723 (2011) - [j58]Donald Nelson, Michael D. Plummer, Neil Robertson, Xiaoya Zha:
On a Conjecture Concerning the Petersen Graph. Electron. J. Comb. 18(1) (2011) - [j57]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 B 101(4): 206-213 (2011) - [j56]Robert E. L. Aldred, Michael D. Plummer:
Proximity thresholds for matching extension in planar and projective planar triangulations. J. Graph Theory 67(1): 38-46 (2011) - [j55]Katsuhiro Ota, Michael D. Plummer, Akira Saito:
Forbidden triples for perfect matchings. J. Graph Theory 67(3): 250-259 (2011) - [p1]Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer:
Domination in Graphs. Structural Analysis of Complex Networks 2011: 73-104 - 2010
- [j54]Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
On well-covered triangulations: Part III. Discret. Appl. Math. 158(8): 894-912 (2010) - [j53]Robert E. L. Aldred, Michael D. Plummer:
Distance-restricted matching extension in planar triangulations. Discret. Math. 310(20): 2618-2636 (2010) - [j52]Ken-ichi Kawarabayashi, Michael D. Plummer:
A note on traversing specified vertices in graphs embedded with large representativity. Discret. Math. 310(20): 2655-2661 (2010)
2000 – 2009
- 2009
- [j51]Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
On well-covered triangulations: Part II. Discret. Appl. Math. 157(13): 2799-2817 (2009) - [j50]Michael D. Plummer, Xiaoya Zha:
On certain spanning subgraphs of embeddings with applications to domination. Discret. Math. 309(14): 4784-4792 (2009) - [j49]Ken-ichi Kawarabayashi, Michael D. Plummer:
Bounding the Size of Equimatchable Graphs of Fixed Genus. Graphs Comb. 25(1): 91-99 (2009) - 2008
- [j48]Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer:
Matching properties in connected domination critical graphs. Discret. Math. 308(7): 1260-1267 (2008) - [j47]Robert E. L. Aldred, Michael D. Plummer:
Restricted matching in graphs of small genus. Discret. Math. 308(24): 5907-5921 (2008) - [j46]Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer:
On the matching extendability of graphs in surfaces. J. Comb. Theory B 98(1): 105-115 (2008) - [c1]Michael D. Plummer:
On the Structure of Graphs Vertex Critical with Respect to Connected Domination. Bonn Workshop of Combinatorial Optimization 2008: 303-315 - 2007
- [j45]Michael D. Plummer:
Graph factors and factorization: 1985-2003: A survey. Discret. Math. 307(7-8): 791-821 (2007) - [j44]Nawarat Ananchuen, Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The odd case. Discret. Math. 307(13): 1651-1658 (2007) - [j43]Nawarat Ananchuen, Michael D. Plummer:
3-Factor-criticality in domination critical graphs. Discret. Math. 307(23): 3006-3015 (2007) - 2006
- [j42]Nawarat Ananchuen, Michael D. Plummer:
Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. Discret. Math. 306(2): 291 (2006) - [j41]Nawarat Ananchuen, Michael D. Plummer:
Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15]. Discret. Math. 306(2): 292 (2006) - [j40]Michael D. Plummer:
Some recent results on domination in graphs. Discuss. Math. Graph Theory 26(3): 457-474 (2006) - [j39]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 B 96(3): 315-324 (2006) - [j38]Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito:
Domination in a graph with a 2-factor. J. Graph Theory 52(1): 1-6 (2006) - 2005
- [j37]Michael A. 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) - [j36]Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft:
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture. J. Comb. Theory B 95(1): 152-167 (2005) - [j35]Michael D. Plummer, Akira Saito:
Forbidden subgraphs and bounds on the size of a maximum matching. J. Graph Theory 50(1): 1-12 (2005) - [j34]Nawarat Ananchuen, Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The even case. Networks 45(4): 210-213 (2005) - 2004
- [j33]Robert E. L. Aldred, Michael D. Plummer:
Edge proximity and matching extension in planar triangulations. Australas. J Comb. 29: 215-224 (2004) - [j32]Nawarat Ananchuen, Michael D. Plummer:
Matching properties in domination critical graphs. Discret. Math. 277(1-3): 1-13 (2004) - [j31]Michael D. Plummer, Xiaoya Zha:
On the p-factor-criticality of the Klein bottle. Discret. Math. 287(1-3): 171-175 (2004) - 2003
- [j30]Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
On well-covered triangulations: Part I. Discret. Appl. Math. 132(1-3): 97-108 (2003) - [j29]Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito:
On two equimatchable graph classes. Discret. Math. 266(1-3): 263-274 (2003) - [j28]Nawarat Ananchuen, Michael D. Plummer:
Some results related to the toughness of 3-domination critical graphs. Discret. Math. 272(1): 5-15 (2003) - [j27]Michael D. Plummer, Michael Stiebitz, Bjarne Toft:
On a special case of Hadwiger's conjecture. Discuss. Math. Graph Theory 23(2): 333-363 (2003) - 2002
- [j26]Michael D. Plummer, Xiaoya Zha:
On the Connectivity of Graphs Embedded in Surfaces II. Electron. J. Comb. 9(1) (2002) - [j25]Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha:
Isoperimetric Constants of Infinite Plane Graphs. Discret. Comput. Geom. 28(3): 313-330 (2002) - [j24]Michael D. Plummer, Xiaoya Zha:
Genus bounds for embeddings with large minimum degree and representativity. Discret. Math. 249(1-3): 167-178 (2002) - 2001
- [j23]Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha:
Bounds for isoperimetric constants of infinite plane graphs. Discret. Appl. Math. 113(2-3): 237-241 (2001) - [j22]Robert E. L. Aldred, Michael D. Plummer:
On restricted matching extension in planar graphs. Discret. Math. 231(1-3): 73-79 (2001) - 2000
- [j21]Michael D. Plummer, Akira Saito:
Closure and factor-critical graphs. Discret. Math. 215: 171-179 (2000)
1990 – 1999
- 1999
- [j20]Robert E. L. Aldred, Michael D. Plummer:
On matching extensions with prescribed and proscribed edge sets II. Discret. Math. 197-198: 29-40 (1999) - [j19]Hikoe Enomoto, Michael D. Plummer, Akira Saito:
Neighborhood unions and factor critical graphs. Discret. Math. 205(1-3): 217-220 (1999) - [j18]Robert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer:
Two results on matching extensions with prescribed and proscribed edge sets. Discret. Math. 206(1-3): 35-43 (1999) - 1998
- [j17]Michael D. Plummer, Xiaoya Zha:
On the Connectivity of Graphs Embedded in Surfaces. J. Comb. Theory B 72(2): 208-228 (1998) - 1997
- [j16]Wayne Goddard, Michael D. Plummer, Henda C. Swart:
Maximum and minimum toughness of graphs of small genus. Discret. Math. 167-168: 329-339 (1997) - 1996
- [j15]Bert L. Hartnell, Michael D. Plummer:
On 4-connected Claw-free Well-covered Graphs. Discret. Appl. Math. 64(1): 57-65 (1996) - [j14]Michael D. Plummer:
Extending matchings in planar graphs V. Discret. Math. 150(1-3): 315-324 (1996) - 1994
- [j13]Michael D. Plummer:
Extending matchings in claw-free graphs. Discret. Math. 125(1-3): 301-307 (1994) - [j12]Michael D. Plummer:
Extending matchings in graphs: A survey. Discret. Math. 127(1-3): 277-292 (1994) - 1992
- [j11]Michael D. Plummer:
Matching theory - a sampler: from Dénes König to the present. Discret. Math. 100(1-3): 177-219 (1992) - [j10]Ervin Györi, Michael D. Plummer:
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. Discret. Math. 101(1-3): 87-96 (1992) - [j9]Michael D. Plummer:
Extending matchings in planar graphs IV. Discret. Math. 109(1-3): 207-219 (1992) - 1991
- [j8]Derek A. Holton, Dingjun Lou, Michael D. Plummer:
On the 2-extendability of planar graphs. Discret. Math. 96(2): 81-99 (1991)
1980 – 1989
- 1988
- [j7]Michael D. Plummer:
Toughness and matching extension in graphs. Discret. Math. 72(1-3): 311-320 (1988) - [j6]Michael D. Plummer:
Matching extension and the genus of a graph. J. Comb. Theory B 44(3): 329-337 (1988) - 1987
- [j5]Michael D. Plummer, Bjarne Toft:
Cyclic coloration of 3-polytopes. J. Graph Theory 11(4): 507-515 (1987) - 1982
- [j4]Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen:
A nine point theorem for 3-connected graphs. Comb. 2(1): 53-62 (1982) - 1980
- [j3]Michael D. Plummer:
On n-extendable graphs. Discret. Math. 31(2): 201-210 (1980)
1970 – 1979
- 1977
- [j2]László Lovász, Michael D. Plummer:
On minimal elementary bipartite graphs. J. Comb. Theory B 23(1): 127-138 (1977) - 1974
- [j1]Michael D. Plummer, Neil Robertson:
Path traversability in planar graphs. Discret. Math. 7(3-4): 289-303 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
