Edge proximity and matching extension in punctured planar triangulations

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

Research output: Contribution to journalArticle

Abstract

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
JournalDiscrete Mathematics
DOIs
Publication statusAccepted/In press - 2017

Fingerprint

Triangulation
Proximity
Connected graph
Plane Graph
Perfect Matching
Face
Graph in graph theory
Planar graph
Triangular
Pairwise

Keywords

  • Distance restricted matching extension
  • Plane graph
  • Punctured triangulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Edge proximity and matching extension in punctured planar triangulations. / Aldred, R. E.L.; Fujisawa, Jun; Saito, Akira.

In: Discrete Mathematics, 2017.

Research output: Contribution to journalArticle

@article{3b34c86110214ba98044c2c749a1f0a0,
title = "Edge proximity and matching extension in punctured planar triangulations",
abstract = "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.",
keywords = "Distance restricted matching extension, Plane graph, Punctured triangulation",
author = "Aldred, {R. E.L.} and Jun Fujisawa and Akira Saito",
year = "2017",
doi = "10.1016/j.disc.2017.07.017",
language = "English",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",

}

TY - JOUR

T1 - Edge proximity and matching extension in punctured planar triangulations

AU - Aldred, R. E.L.

AU - Fujisawa, Jun

AU - Saito, Akira

PY - 2017

Y1 - 2017

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

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

KW - Distance restricted matching extension

KW - Plane graph

KW - Punctured triangulation

UR - http://www.scopus.com/inward/record.url?scp=85027441616&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027441616&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2017.07.017

DO - 10.1016/j.disc.2017.07.017

M3 - Article

AN - SCOPUS:85027441616

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

ER -