A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph
From MaRDI portal
Publication:2319727
DOI10.1016/j.disc.2019.03.015zbMath1418.05080OpenAlexW2947892382MaRDI QIDQ2319727
Masao Tsugaki, Takamasa Yashima
Publication date: 20 August 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.03.015
Related Items (1)
Cites Work
- Unnamed Item
- Characterizing degree-sum maximal nonhamiltonian bipartite graphs
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Degree sum conditions for path-factors with specified end vertices in bipartite graphs
- On Hamiltonian bipartite graphs
- 2‐neighborhoods and hamiltonian conditions
- Generalization of a Theorem of Posa
This page was built for publication: A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph