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

Ryota Matsubara, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita

Research output: Contribution to journalArticle

4 Citations (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.

Original languageEnglish
Pages (from-to)87-95
Number of pages9
JournalDiscrete Mathematics
Issue number2
Publication statusPublished - 2017 Feb 6



  • Bipartite graph
  • Degree sum condition
  • Path-factor

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this