Spanning trees with at most 55 leaves and branch vertices in total of K1,5K_{1,5}-free graphs

preprint2022arXivOpen access

Abstract

In this paper, we prove that every nn-vertex connected K1,5K_{1,5}-free graph GG with σ4(G)≥n−1σ_4(G)\geq n-1 contains a spanning tree with at most 55 leaves and branch vertices in total. Moreover, the degree sum condition "σ4(G)≥n−1σ_4(G)\geq n-1" is best possible.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.