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

Discrete Mathematics - Tập 340 - Trang 87-95 - 2017
Ryota Matsubara1, Hajime Matsumura2, Masao Tsugaki3, Tomoki Yamashita4
1Department of Mathematics, Shibaura Institute of Technology, 307 Fukasaku, Saitama, 337-8577, Japan
2College of Education, Ibaraki University, 2-1-1 Bunkyo, Mito, Ibaraki 310-8512, Japan
3Department of Mathematics, Kindai University, 3-4-1 Kowakae, Higashi-Osaka, Osaka 577-8502, Japan
4Tokyo University of Science, 1-3 kagurazaka, Shinjuku-ku, Tokyo, Japan

Tài liệu tham khảo

Akiyama, 1980, On a {1,2}-factor of a graph, TUR Math., 16, 97 Gallai, 1961, Maximum-minimum Sat˝ze und verallgemeinerte Faktoren von Graphen, Acta Math. Acad. Scient. Hungar., 12, 131, 10.1007/BF02066678 Kronk, 1969, A generalization of a theorem of Pósa, Proc. Amer. Math. Soc., 21, 77 Yamashita, 2016, Relationship between results on degree sum conditions for cycles, paths and trees, RIMS Kôkyûroku Bessatsu, 1986, 92 Zamani, 2012, Spanning cycles through specified edges in bipartite graphs, J. Graph Theory, 71, 1, 10.1002/jgt.20627
Thông tin
Thông tin xuất bản

Discrete Mathematics

Tập 340

87-95

Thông tin tác giả