| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903209 | Discrete Mathematics | 2017 | 8 Pages |
Abstract
In this paper, we prove that if G is a 5-connected plane graph of even order in which at most two faces are not triangular and M is a matching of size four in which the edges lie pairwise distance at least three apart, then M is extendable. A related result concerning perfect matching with proscribed edges is shown as well.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
R.E.L. Aldred, Jun Fujisawa, Akira Saito,