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 |
Keywords
- AMS classification 05C70: 05C10
- distance restricted matching extension
- plane graph
- triangulation
ASJC Scopus subject areas
- Geometry and Topology