Edge proximity and matching extension in projective planar graphs

Jun Fujisawa, Hiroki Seno

研究成果: Article

抜粋

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 M containing M. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 3 7-extendable for any m.

元の言語English
ジャーナルJournal of Graph Theory
DOI
出版物ステータスAccepted/In press - 2020 1 1

ASJC Scopus subject areas

  • Geometry and Topology

フィンガープリント Edge proximity and matching extension in projective planar graphs' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用