Degree sum conditions for path-factors with specified end vertices in bipartite graphs

作者：Matsubara Ryota^*; Matsumura Hajime; Tsugaki Masao; Yamashita Tomoki

来源：Discrete Mathematics, 2017, 340(2): 87-95.

DOI：10.1016/j.disc.2016.07.015

• Path-factor
• Bipartite graph
• Degree sum condition

Let G be a graph, and let S be a subset of the vertex set of G. We denote the set of the end vertices of a path P by end(P). A path P is an S-path if vertical bar V(P)vertical bar >= 2 and V(P) boolean AND S = end(P). An S-path-system is a graph H such that H contains all vertices of S and every component of H is an S-path. In this paper, we give a sharp degree sum condition for a bipartite graph to have a spanning S-path-system.

• 出版日期2017-2-6