Edge proximity and matching extension in punctured planar triangulations

R. E.L. Aldred, Jun Fujisawa, Akira Saito

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


A matching M in a graph G is said to be extendable if there exists a perfect matching of G containing M. In 1989, it was shown that every connected planar graph with at least 8 vertices has a matching of size three which is not extendable. In contrast, the study of extending certain matchings of size three or more has made progress in the past decade when the given graph is 5-connected planar triangulation or 5-connected plane graphs with few non-triangular faces. In this paper, we prove that if G is a 5-connected plane graph of even order in which at most two faces are not triangular and M is a matching of size four in which the edges lie pairwise distance at least three apart, then M is extendable. A related result concerning perfect matching with proscribed edges is shown as well.

Original languageEnglish
Pages (from-to)2978-2985
Number of pages8
JournalDiscrete Mathematics
Issue number12
Publication statusPublished - 2017 Dec


  • Distance restricted matching extension
  • Plane graph
  • Punctured triangulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


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

Cite this