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.
| Original language | English |
|---|---|
| Pages (from-to) | 87-95 |
| Number of pages | 9 |
| Journal | Discrete Mathematics |
| Volume | 340 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2017 Feb 6 |
Keywords
- Bipartite graph
- Degree sum condition
- Path-factor
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint Dive into the research topics of 'Degree sum conditions for path-factors with specified end vertices in bipartite graphs'. Together they form a unique fingerprint.
Cite this
Matsubara, R., Matsumura, H., Tsugaki, M., & Yamashita, T. (2017). Degree sum conditions for path-factors with specified end vertices in bipartite graphs. Discrete Mathematics, 340(2), 87-95. https://doi.org/10.1016/j.disc.2016.07.015