The SCEAS System
| |||||||

## Search the dblp DataBase
Michael D. Plummer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen
**A nine point theorem for 3-connected graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1982, v:2, n:1, pp:53-62 [Journal] - Michael D. Plummer, Xiaoya Zha
**On the Connectivity of Graphs Embedded in Surfaces II.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal] - Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer
**On well-covered triangulations: Part I.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:97-108 [Journal] - Bert Hartnell, Michael D. Plummer
**On 4-connected Claw-free Well-covered Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:1, pp:57-65 [Journal] - Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha
**Bounds for isoperimetric constants of infinite plane graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:237-241 [Journal] - Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha
**Isoperimetric Constants of Infinite Plane Graphs.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2002, v:28, n:3, pp:313-330 [Journal] - Nawarat Ananchuen, Michael D. Plummer
**Some results related to the toughness of 3-domination critical graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:1, pp:5-15 [Journal] - Nawarat Ananchuen, Michael D. Plummer
**Matching properties in domination critical graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:277, n:1-3, pp:1-13 [Journal] - Nawarat Ananchuen, Michael D. Plummer
**Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13].**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:2, pp:291- [Journal] - Nawarat Ananchuen, Michael D. Plummer
**Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15].**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:2, pp:292- [Journal] - Robert E. L. Aldred, Michael D. Plummer
**On restricted matching extension in planar graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:231, n:1-3, pp:73-79 [Journal] - Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
**On two equimatchable graph classes.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:266, n:1-3, pp:263-274 [Journal] - Michael D. Plummer, Akira Saito
**Closure and factor-critical graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:215, n:, pp:171-179 [Journal] - Michael D. Plummer, Xiaoya Zha
**Genus bounds for embeddings with large minimum degree and representativity.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:249, n:1-3, pp:167-178 [Journal] - Michael D. Plummer, Xiaoya Zha
**On the**[Citation Graph (0, 0)][DBLP]*p*-factor-criticality of the Klein bottle. Discrete Mathematics, 2004, v:287, n:1-3, pp:171-175 [Journal] - Michael D. Plummer
**Graph factors and factorization: 1985-2003: A survey.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:7-8, pp:791-821 [Journal] - Nawarat Ananchuen, Michael D. Plummer
**Matchings in 3-vertex-critical graphs: The odd case.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:13, pp:1651-1658 [Journal] - Michael D. Henning, Michael D. Plummer
**Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2005, v:10, n:3, pp:283-294 [Journal] - Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft
**Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:152-167 [Journal] - Michael D. Plummer
**Matching extension and the genus of a graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:329-337 [Journal] - Michael D. Plummer, Xiaoya Zha
**On the Connectivity of Graphs Embedded in Surfaces.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1998, v:72, n:2, pp:208-228 [Journal] - Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
**A pair of forbidden subgraphs and perfect matchings.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:315-324 [Journal] - László Lovász, Michael D. Plummer
**On minimal elementary bipartite graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1977, v:23, n:1, pp:127-138 [Journal] - Nawarat Ananchuen, Michael D. Plummer
**Matchings in 3-vertex-critical graphs: The even case.**[Citation Graph (0, 0)][DBLP] Networks, 2005, v:45, n:4, pp:210-213 [Journal] - Michael D. Plummer, Akira Saito
**Forbidden subgraphs and bounds on the size of a maximum matching.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:50, n:1, pp:1-12 [Journal] - Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
**Domination in a graph with a 2-factor.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:52, n:1, pp:1-6 [Journal] - Michael D. Plummer
**On n-extendable graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1980, v:31, n:2, pp:201-210 [Journal] - Michael D. Plummer
**Toughness and matching extension in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:72, n:1-3, pp:311-320 [Journal] - Hikoe Enomoto, Michael D. Plummer, Akira Saito
**Neighborhood unions and factor critical graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:205, n:1-3, pp:217-220 [Journal] - Robert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer
**Two results on matching extensions with prescribed and proscribed edge sets.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:206, n:1-3, pp:35-43 [Journal] - Robert E. L. Aldred, Michael D. Plummer
**On matching extensions with prescribed and proscribed edge sets II.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:29-40 [Journal] - Wayne Goddard, Michael D. Plummer, Henda C. Swart
**Maximum and minimum toughness of graphs of small genus.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:329-339 [Journal] - Derek A. Holton, Dingjun Lou, Michael D. Plummer
**On the 2-extendability of planar graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:96, n:2, pp:81-99 [Journal] - Michael D. Plummer
**Matching theory - a sampler: from Dénes König to the present.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:100, n:1-3, pp:177-219 [Journal] - Ervin Györi, Michael D. Plummer
**The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:101, n:1-3, pp:87-96 [Journal] - Michael D. Plummer
**Extending matchings in planar graphs IV.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:109, n:1-3, pp:207-219 [Journal] - Michael D. Plummer
**Extending matchings in planar graphs V.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:150, n:1-3, pp:315-324 [Journal] - Michael D. Plummer
**Extending matchings in claw-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:125, n:1-3, pp:301-307 [Journal] - Michael D. Plummer
**Extending matchings in graphs: A survey.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:127, n:1-3, pp:277-292 [Journal] **On well-covered triangulations: Part II.**[Citation Graph (, )][DBLP]**On well-covered triangulations: Part III.**[Citation Graph (, )][DBLP]**3-Factor-criticality in domination critical graphs.**[Citation Graph (, )][DBLP]**Matching properties in connected domination critical graphs.**[Citation Graph (, )][DBLP]**Restricted matching in graphs of small genus.**[Citation Graph (, )][DBLP]**On certain spanning subgraphs of embeddings with applications to domination.**[Citation Graph (, )][DBLP]**Distance-restricted matching extension in planar triangulations.**[Citation Graph (, )][DBLP]**A note on traversing specified vertices in graphs embedded with large representativity.**[Citation Graph (, )][DBLP]
Search in 0.032secs, Finished in 0.033secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |