Abstract
Abstract 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 G containing M. In this article we prove that every 5-connected triangulation on the plane of even order is distance 3 9-extendable and distance 4 m-extendable for any m.
| Original language | English |
|---|---|
| Pages (from-to) | 1-11 |
| Number of pages | 11 |
| Journal | Journal of Graph Theory |
| Volume | 80 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2015 Sep 1 |
Fingerprint
Keywords
- AMS classification 05C70: 05C10
- distance restricted matching extension
- plane graph
- triangulation
ASJC Scopus subject areas
- Geometry and Topology
Cite this
Edge Proximity Conditions for Extendability in Planar Triangulations. / Fujisawa, Jun; Ota, Katsuhiro.
In: Journal of Graph Theory, Vol. 80, No. 1, 01.09.2015, p. 1-11.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Edge Proximity Conditions for Extendability in Planar Triangulations
AU - Fujisawa, Jun
AU - Ota, Katsuhiro
PY - 2015/9/1
Y1 - 2015/9/1
N2 - Abstract 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 G containing M. In this article we prove that every 5-connected triangulation on the plane of even order is distance 3 9-extendable and distance 4 m-extendable for any m.
AB - Abstract 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 G containing M. In this article we prove that every 5-connected triangulation on the plane of even order is distance 3 9-extendable and distance 4 m-extendable for any m.
KW - AMS classification 05C70: 05C10
KW - distance restricted matching extension
KW - plane graph
KW - triangulation
UR - http://www.scopus.com/inward/record.url?scp=84936886265&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84936886265&partnerID=8YFLogxK
U2 - 10.1002/jgt.21827
DO - 10.1002/jgt.21827
M3 - Article
AN - SCOPUS:84936886265
VL - 80
SP - 1
EP - 11
JO - Journal of Graph Theory
JF - Journal of Graph Theory
SN - 0364-9024
IS - 1
ER -