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

Ryota Matsubara, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita

研究成果: Article

5 引用 (Scopus)

抜粋

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 |V(P)|≥2 and V(P)∩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.

元の言語English
ページ(範囲)87-95
ページ数9
ジャーナルDiscrete Mathematics
340
発行部数2
DOI
出版物ステータスPublished - 2017 2 6

    フィンガープリント

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

これを引用