@article{a54caa11fb0149d9906b695844f49b6a,
title = "Edge proximity and matching extension in projective planar graphs",
abstract = "A graph (Formula presented.) with at least (Formula presented.) vertices is said to be distance (Formula presented.) (Formula presented.) -extendable if, for any matching (Formula presented.) of (Formula presented.) with (Formula presented.) edges in which the edges lie at distance at least (Formula presented.) pairwise, there exists a perfect matching of (Formula presented.) containing (Formula presented.). 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 (Formula presented.) -extendable for any (Formula presented.).",
keywords = "edge proximity, matching extension, projective plane graph, triangulation",
author = "Jun Fujisawa and Hiroki Seno",
note = "Funding Information: The authors would like to thank Atsuhiro Nakamoto for his valuable comments. Moreover, the authors are grateful to an anonymous referee whose comments significantly helped to improve the original manuscript. Supported by JSPS Grant‐in‐Aid for Scientific Research (B) 16H03952, (C) 17K05349, and JSPS Grant‐in‐Aid for Young Scientists (B) 26800085. Publisher Copyright: {\textcopyright} 2020 Wiley Periodicals, Inc.",
year = "2020",
month = nov,
day = "1",
doi = "10.1002/jgt.22559",
language = "English",
volume = "95",
pages = "341--367",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",
}