Edge proximity and matching extension in projective planar graphs |
| |
Authors: | Jun Fujisawa Hiroki Seno |
| |
Affiliation: | 1. Faculty of Business and Commerce, Keio University, Yokohama, Japan;2. Graduate School of Environment and Information Science, Yokohama National University, Yokohama, Japan |
| |
Abstract: | A graph with at least vertices is said to be distance -extendable if, for any matching of with edges in which the edges lie at distance at least pairwise, there exists a perfect matching of containing . In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 -extendable for any . |
| |
Keywords: | edge proximity matching extension projective plane graph triangulation |
|
|