Distance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle

Electronic Journal Of Combinatorics

Robert E.L. Aldred¹ 

关键词: distance restricted matching extension;    triangulation;    toroidal graph;    Klein bottle graph;    non-contractible cycle;    separating cycle;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 pap

【 授权许可】

Others