### 抜粋

A graph G with at least 2m + 2 edges is said to be distance d m-extendable if for any matching M in G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching in G containing M. In a previous paper, Aldred and Plummer proved that every 5-connected triangulation of the plane or the projective plane of even order is distance 5 m-extendable for any m. In this paper we prove that the same conclusion holds for every triangulation of the torus or the Klein bottle.

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

ジャーナル | Electronic Journal of Combinatorics |

巻 | 21 |

発行部数 | 3 |

出版物ステータス | Published - 2014 9 18 |

### フィンガープリント

### ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics