Graphs and Combinatorics ( IF 0.6 ) Pub Date : 2021-03-24 , DOI: 10.1007/s00373-021-02295-9 R. E. L. Aldred , Jun Fujisawa , Akira Saito
A graph G is said to be distance d matchable if, for any matching M of G in which edges are pairwise at least distance d apart, there exists a perfect matching \(M^*\) of G which contains M. In this paper, we prove the following results: (i) if G is a cubic bipartite graph in which, for each \(e \in E(G)\), there exist two cycles \(C_1\), \(C_2\) of length at most d such that \(E(C_1) \cap E(C_2) = \{e\}\), then G is distance \(d-1\) matchable, and (ii) if G is a planar or projective planar cubic bipartite graph in which, for each \(e \in E(G)\), there exist two cycles \(C_1\), \(C_2\) of length at most 6 such that \(e \in E(C_1) \cap E(C_2)\), then G is distance 6 matchable.
中文翻译:
三次二分图中的距离匹配扩展
如果对于其中边缘成对地至少相隔距离d的G的任何匹配M,存在一个包含M的G的完美匹配\(M ^ * \),则说说图G是距离 d可匹配的。在本文中,我们证明以下结果:(i)如果G是三次二部图,其中对于每个\(e \ E(G)\),存在两个循环\(C_1 \),\(C_2最长为d的\),使得\(E(C_1)\ cap E(C_2)= \ {e \} \),则G为距离\(d-1 \)可匹配,并且(ii)如果G是一个平面或射影平面立方二分图,其中对于每个\(e(在E(G)\)中,存在两个循环\(C_1 \),最大长度为6的\(C_2 \)使得\(e \ in E(C_1)\ cap E(C_2)\),则G为距离6可匹配。