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

  • 2 Citations

Abstract

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.

LanguageEnglish
Pages87-95
Number of pages9
JournalDiscrete Mathematics
Volume340
Issue number2
DOIs
StatePublished - 2017 Feb 6

Keywords

  • Bipartite graph
  • Degree sum condition
  • Path-factor

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Degree sum conditions for path-factors with specified end vertices in bipartite graphs. / Matsubara, Ryota; Matsumura, Hajime; Tsugaki, Masao; Yamashita, Tomoki.

In: Discrete Mathematics, Vol. 340, No. 2, 06.02.2017, p. 87-95.

Research output: Contribution to journalArticle

Matsubara, Ryota ; Matsumura, Hajime ; Tsugaki, Masao ; Yamashita, Tomoki. / Degree sum conditions for path-factors with specified end vertices in bipartite graphs. In: Discrete Mathematics. 2017 ; Vol. 340, No. 2. pp. 87-95
@article{ea0fec1ffcf24646a309ae7bfcfba920,
title = "Degree sum conditions for path-factors with specified end vertices in bipartite graphs",
abstract = "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.",
keywords = "Bipartite graph, Degree sum condition, Path-factor",
author = "Ryota Matsubara and Hajime Matsumura and Masao Tsugaki and Tomoki Yamashita",
year = "2017",
month = "2",
day = "6",
doi = "10.1016/j.disc.2016.07.015",
language = "English",
volume = "340",
pages = "87--95",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

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

AU - Matsubara,Ryota

AU - Matsumura,Hajime

AU - Tsugaki,Masao

AU - Yamashita,Tomoki

PY - 2017/2/6

Y1 - 2017/2/6

N2 - 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.

AB - 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.

KW - Bipartite graph

KW - Degree sum condition

KW - Path-factor

UR - http://www.scopus.com/inward/record.url?scp=84984832848&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84984832848&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2016.07.015

DO - 10.1016/j.disc.2016.07.015

M3 - Article

VL - 340

SP - 87

EP - 95

JO - Discrete Mathematics

T2 - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2

ER -