Edge proximity and matching extension in projective planar graphs

Jun Fujisawa, Hiroki Seno

Research output: Contribution to journalArticle


A graph G with at least 2m + 2 vertices is said to be distance d m-extendable if, for any matching M of G with m edges in which the edges lie at distance at least d pairwise, there exists a perfect matching of M containing M. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 3 7-extendable for any m.

Original languageEnglish
JournalJournal of Graph Theory
Publication statusAccepted/In press - 2020 Jan 1


  • edge proximity
  • matching extension
  • projective plane graph
  • triangulation

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Edge proximity and matching extension in projective planar graphs'. Together they form a unique fingerprint.

Cite this