Edge Proximity Conditions for Extendability in Planar Triangulations

研究成果: Article査読

6 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)1-11
ページ数11
ジャーナルJournal of Graph Theory
80
1
DOI
出版ステータスPublished - 2015 9 1

ASJC Scopus subject areas

  • Geometry and Topology

フィンガープリント 「Edge Proximity Conditions for Extendability in Planar Triangulations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル