Spanning trees whose reducible stems have a few branch vertices
Pham Hoang Ha; Dang Dinh Hanh; Nguyen Thanh Loan; Ngoc Diep Pham
Czechoslovak Mathematical Journal (2021)
- Volume: 71, Issue: 3, page 697-708
- ISSN: 0011-4642
Access Full Article
topAbstract
topHow to cite
topReferences
top- Broersma, H., Tuinstra, H., 10.1002/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W, J. Graph Theory 29 (1998), 227-237 9999DOI99999 10.1002/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W . (1998) Zbl0919.05017MR1653817DOI10.1002/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W
- Chen, Y., Chen, G., Hu, Z., Spanning 3-ended trees in -connected -free graphs, Sci. China, Math. 57 (2014), 1579-1586 9999DOI99999 10.1007/s11425-014-4817-z . (2014) Zbl1299.05034MR3229223
- Chen, Y., Ha, P. H., Hanh, D. D., Spanning trees with at most 4 leaves in -free graphs, Discrete Math. 342 (2019), 2342-2349 9999DOI99999 10.1016/j.disc.2019.05.005 . (2019) Zbl1418.05050MR3954055
- Diestel, R., Graph Theory, Graduate Texts in Mathematics 173. Springer, Berlin (2005),9999DOI99999 10.1007/978-3-662-53622-3 . (2005) Zbl1074.05001MR2159259
- Ha, P. H., Hanh, D. D., Spanning trees of connected -free graphs whose stems have a few leaves, Bull. Malays. Math. Sci. Soc. (2) 43 (2020), 2373-2383 9999DOI99999 10.1007/s40840-019-00812-x . (2020) Zbl1437.05044MR4089649
- Ha, P. H., Hanh, D. D., Loan, N. T., 10.11650/tjm/201201, Taiwanese J. Math. 25 (2021), 435-447. (2021) DOI10.11650/tjm/201201
- Kano, M., Kyaw, A., Matsuda, H., Ozeki, K., Saito, A., Yamashita, T., Spanning trees with a bounded number of leaves in a claw-free graph, Ars Combin. 103 (2012), 137-154 9999MR99999 2907328 . (2012) Zbl1265.05100MR2907328
- Kano, M., Yan, Z., Spanning trees whose stems have at most leaves, Ars Combin. 117 (2014), 417-424 9999MR99999 3243859 . (2014) Zbl1349.05056MR3243859
- Kano, M., Yan, Z., Spanning trees whose stems are spiders, Graphs Comb. 31 (2015), 1883-1887 9999DOI99999 10.1007/s00373-015-1618-2 . (2015) Zbl1330.05041MR3417201
- Kyaw, A., Spanning trees with at most 3 leaves in -free graphs, Discrete Math. 309 (2009), 6146-6148 9999DOI99999 10.1016/j.disc.2009.04.023 . (2009) Zbl1183.05019MR2552650
- Kyaw, A., Spanning trees with at most leaves in -free graphs, Discrete Math. 311 (2011), 2135-2142 9999DOI99999 10.1016/j.disc.2011.06.025 . (2011) Zbl1235.05033MR2825657
- Vergnas, M. Las, Sur une propriété des arbres maximaux dans un graphe, C. R. Acad. Sci., Paris, Sér. A 272 (1971), 1297-1300 French. (1971) Zbl0221.05053MR0277423
- Maezawa, S.-i., Matsubara, R., Matsuda, H., Degree conditions for graphs to have spanning trees with few branch vertices and leaves, Graphs Comb. 35 (2019), 231-238 9999DOI99999 10.1007/s00373-018-1998-1 . (2019) Zbl1407.05053MR3898387
- Matthews, M. M., Sumner, D. P., Hamiltonian results in -free graphs, J. Graph Theory 8 (1984), 139-146 9999DOI99999 10.1002/jgt.3190080116 . (1984) Zbl0536.05047MR0732027
- Ozeki, K., Yamashita, T., Spanning trees: A survey, Graphs Comb. 27 (2011), 1-26 9999DOI99999 10.1007/s00373-010-0973-2 . (2011) Zbl1232.05055MR2746831
- Tsugaki, M., Zhang, Y., Spanning trees whose stems have a few leaves, Ars Comb. 114 (2014), 245-256. (2014) Zbl1324.05025MR3203267
- Win, S., On a conjecture of Las Vergnas concerning certain spanning trees in graphs, Result. Math. 2 (1979), 215-224 9999DOI99999 10.1007/BF03322958 . (1979) Zbl0432.05035MR0565381
- Yan, Z., Spanning trees whose stems have a bounded number of branch vertices, Discuss. Math., Graph Theory 36 (2016), 773-778 9999DOI99999 10.7151/dmgt.1885 . (2016) Zbl1339.05212MR3518139