Distance-restricted matching extension in triangulations of the torus and the Klein bottle

R. E L Aldred, Jun Fujisawa

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

A graph G with at least 2m + 2 edges is said to be distance d m-extendable if for any matching M in G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching in G containing M. In a previous paper, Aldred and Plummer proved that every 5-connected triangulation of the plane or the projective plane of even order is distance 5 m-extendable for any m. In this paper we prove that the same conclusion holds for every triangulation of the torus or the Klein bottle.

Original languageEnglish
JournalElectronic Journal of Combinatorics
Volume21
Issue number3
Publication statusPublished - 2014 Sep 18

Fingerprint

Klein bottle
Bottles
Triangulation
Torus
Perfect Matching
Projective plane
Graph in graph theory

Keywords

  • Distance restricted matching extension
  • Klein bottle graph
  • Non-contractible cycle
  • Separating cycle
  • Toroidal graph
  • Triangulation

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Distance-restricted matching extension in triangulations of the torus and the Klein bottle. / Aldred, R. E L; Fujisawa, Jun.

In: Electronic Journal of Combinatorics, Vol. 21, No. 3, 18.09.2014.

Research output: Contribution to journalArticle

@article{9eaf0662fc0c4c13a81603ac7cbb469a,
title = "Distance-restricted matching extension in triangulations of the torus and the Klein bottle",
abstract = "A graph G with at least 2m + 2 edges is said to be distance d m-extendable if for any matching M in G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching in G containing M. In a previous paper, Aldred and Plummer proved that every 5-connected triangulation of the plane or the projective plane of even order is distance 5 m-extendable for any m. In this paper we prove that the same conclusion holds for every triangulation of the torus or the Klein bottle.",
keywords = "Distance restricted matching extension, Klein bottle graph, Non-contractible cycle, Separating cycle, Toroidal graph, Triangulation",
author = "Aldred, {R. E L} and Jun Fujisawa",
year = "2014",
month = "9",
day = "18",
language = "English",
volume = "21",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "3",

}

TY - JOUR

T1 - Distance-restricted matching extension in triangulations of the torus and the Klein bottle

AU - Aldred, R. E L

AU - Fujisawa, Jun

PY - 2014/9/18

Y1 - 2014/9/18

N2 - A graph G with at least 2m + 2 edges is said to be distance d m-extendable if for any matching M in G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching in G containing M. In a previous paper, Aldred and Plummer proved that every 5-connected triangulation of the plane or the projective plane of even order is distance 5 m-extendable for any m. In this paper we prove that the same conclusion holds for every triangulation of the torus or the Klein bottle.

AB - A graph G with at least 2m + 2 edges is said to be distance d m-extendable if for any matching M in G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching in G containing M. In a previous paper, Aldred and Plummer proved that every 5-connected triangulation of the plane or the projective plane of even order is distance 5 m-extendable for any m. In this paper we prove that the same conclusion holds for every triangulation of the torus or the Klein bottle.

KW - Distance restricted matching extension

KW - Klein bottle graph

KW - Non-contractible cycle

KW - Separating cycle

KW - Toroidal graph

KW - Triangulation

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

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

M3 - Article

AN - SCOPUS:84907698803

VL - 21

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 3

ER -