### 抜粋

A matching M in a graph G is said to be extendable if there exists a perfect matching of G containing M. In 1989, it was shown that every connected planar graph with at least 8 vertices has a matching of size three which is not extendable. In contrast, the study of extending certain matchings of size three or more has made progress in the past decade when the given graph is 5-connected planar triangulation or 5-connected plane graphs with few non-triangular faces.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.

元の言語 | English |
---|---|

ジャーナル | Discrete Mathematics |

DOI | |

出版物ステータス | Accepted/In press - 2017 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## フィンガープリント Edge proximity and matching extension in punctured planar triangulations' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Discrete Mathematics*. https://doi.org/10.1016/j.disc.2017.07.017