The following pages link to Michael D. Plummer (Q189707):
Displaying 50 items.
- Inflations of anti-cycles and Hadwiger's conjecture (Q286763) (← links)
- Distance matching in punctured planar triangulations (Q286771) (← links)
- Well-covered triangulations. IV (Q323041) (← links)
- Dominating plane triangulations (Q335349) (← links)
- Forbidden subgraphs generating a finite set (Q383734) (← links)
- (Q405120) (redirect page) (← links)
- On a conjecture concerning the Petersen graph. II (Q405121) (← links)
- Proximity thresholds for matching extension in the torus and Klein bottle (Q423899) (← links)
- Matching extension in prism graphs (Q512532) (← links)
- On well-covered pentagonalizations of the plane (Q526819) (← links)
- The 2-extendability of 5-connected graphs on surfaces with large representativity (Q536645) (← links)
- (Q685550) (redirect page) (← links)
- Corrigendum to: ``On the 2-extendability of planar graphs'', Discrete Mathematics 96 (1991) 81-99 (Q685551) (← links)
- Extending matchings in planar graphs. IV (Q686303) (← links)
- On the connectivity of graphs embedded in surfaces. II (Q700012) (← links)
- Distance-restricted matching extension in planar triangulations (Q709306) (← links)
- A note on traversing specified vertices in graphs embedded with large representativity (Q709309) (← links)
- A note on cyclic connectivity and matching properties of regular graphs (Q742609) (← links)
- Path traversability in planar graphs (Q759035) (← links)
- Restricted matching in plane triangulations and near triangulations (Q777390) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Matchings in 3-vertex-critical graphs: the odd case (Q879342) (← links)
- On well-covered triangulations. II. (Q967322) (← links)
- On well-covered triangulations. III (Q972324) (← links)
- Vertices contained in all or in no minimum paired-dominating set of a tree (Q995930) (← links)
- Restricted matching in graphs of small genus (Q998321) (← links)
- Bounding the size of equimatchable graphs of fixed genus (Q1043800) (← links)
- On certain spanning subgraphs of embeddings with applications to domination (Q1044949) (← links)
- Matching theory (Q1088987) (← links)
- Matching extension and the genus of a graph (Q1107545) (← links)
- On n-extendable graphs (Q1143417) (← links)
- A nine point theorem for 3-connected graphs (Q1165867) (← links)
- On the 2-extendability of planar graphs (Q1186375) (← links)
- The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable (Q1197017) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- On minimal elementary bipartite graphs (Q1245978) (← links)
- Mengerian theorems for paths of bounded length (Q1252354) (← links)
- On the connectivity of graphs embedded in surfaces (Q1272478) (← links)
- On matching extensions with prescribed and proscribed edge sets. II (Q1292810) (← links)
- Neighborhood unions and factor critical graphs (Q1301846) (← links)
- Two results on matching extensions with prescribed and proscribed edge sets (Q1304803) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- Extending matchings in claw-free graphs (Q1322284) (← links)
- Maximum and minimum toughness of graphs of small genus (Q1356471) (← links)
- On well-covered triangulations. I (Q1414586) (← links)
- Some results related to the toughness of 3-domination critical graphs (Q1415537) (← links)
- Matching properties in domination critical graphs. (Q1426104) (← links)
- Genus bounds for embeddings with large minimum degree and representativity (Q1598852) (← links)
- On two equimatchable graph classes (Q1810651) (← links)
- Toughness and matching extension in graphs (Q1824634) (← links)
