A degree sum condition for the existence of an S-path-system in a bipartite graph
A degree sum condition for the existence of an S-path-system in a bipartite graph
复制标题
二分图中S路径系统存在的度和条件
DOI：
10.1016/j.disc.2019.03.015
复制
发表时间：
2019
影响因子：
0.8
通讯作者：
T. Yashima
中科院分区：
文献类型：
--
作者：
M. Tsugaki;T. Yashima
设G是一个图，S是V(G)的偶数阶子集。我们用e n d(P)表示路径P的端点集。一条路P称为S路，如果|V(P)|≥2且V(P)∩S=e n d(P)。L-S路系P是一组点不相交的S路，使得S=⋃P∈P(V(P)∩S)且|V(P)|≤L对任意P∈P。本文给出了二部图有L-S路系使得L小的一个锐度和条件。
Let G be a graph, and S be a subset of V (G) with even order. We denote the set of the end vertices of a path P by e n d (P). A path P is called an S-path if| V (P)|≥ 2 and V (P)∩ S= e n d (P). An l-S-path-system P is a set of vertex-disjoint S-paths such that S=⋃ P∈ P (V (P)∩ S) and| V (P)|≤ l for any P∈ P. In this paper, we give a sharp degree sum condition for a bipartite graph to have an l-S-path-system such that l is small.