Distance matching extension in cubic bipartite graphs (Q2051886): Difference between revisions

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^\ast\) of \(G\) which contains \(M\). The authors of this article prove the following results: \begin{itemize} \item[(1)] 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. \item[(2)] 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. \end{itemize}