Edge proximity and matching extension in projective planar graphs
Jun Fujisawa, Hiroki Seno · Journal of Graph Theory · 2020
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 .