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

DOI10.1016/j.disc.2016.07.015zbMath1351.05129OpenAlexW2512607386MaRDI QIDQ2374163

Ryota Matsubara, Tomoki Yamashita, Hajime Matsumura, Masao Tsugaki

Publication date: 14 December 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.07.015

zbMATH Keywords

bipartite graphpath factordegree sum condition

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex degrees (05C07)

Related Items (8)

Unnamed Item ⋮ A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph ⋮ Some results about ID-path-factor critical graphs ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Spanning bipartite graphs with large degree sum in graphs of odd order ⋮ A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph

Cites Work

• Unnamed Item
• Spanning Cycles Through Specified Edges in Bipartite Graphs
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• Generalization of a Theorem of Posa

This page was built for publication: Degree sum conditions for path-factors with specified end vertices in bipartite graphs