Edge proximity and matching extension in projective planar graphs

Jun Fujisawa, Hiroki Seno

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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.).

Original languageEnglish
Pages (from-to)341-367
Number of pages27
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - 2020 Nov 1


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

ASJC Scopus subject areas

  • Geometry and Topology


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

Cite this