论文信息 - Degree Conditions for Spanning Brooms

Degree Conditions for Spanning Brooms

A broom is a tree obtained by subdividing one edge of the star an arbitrary number of times. In (E. Flandrin, T. Kaiser, R. Kužel, H. Li and Z. Ryjacek, Neighborhood Unions and Extremal Spanning Trees, Discrete Math 308 (2008), 2343–2350) Flandrin et al. posed the problem of determining degree conditions that ensure a connected graph G contains a spanning tree that is a broom. In this article, we give one solution to this problem by demonstrating that if G is a connected graph of order with , then G contains a spanning broom. This result is best possible.

[1] Luisa Gargano,et al. There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them) , 2003, ICALP.

[2] Jan van den Heuvel. Long cycles in graphs with large degree sums and neighborhood unions , 1996, J. Graph Theory.

[3] Kenta Ozeki,et al. Spanning Trees: A Survey , 2011, Graphs Comb..

[4] Jin Akiyama,et al. Factors and Factorizations of Graphs , 2011 .

[5] D. R. Woodall. The binding number of a graph and its Anderson number , 1973 .

[6] Pavol Hell,et al. Spanning spiders and light-splitting switches , 2004, Discret. Math..

[7] 秋山仁,et al. Factors and factorizations of graphs : proof techniques in factor theory , 2011 .

[8] Zdenek Ryjácek,et al. Neighborhood unions and extremal spanning trees , 2008, Discret. Math..

[9] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[10] Pavol Hell,et al. Spanning Trees with Bounded Number of Branch Vertices , 2002, ICALP.

[11] O. Ore. Note on Hamilton Circuits , 1960 .

[12] Zhao Ke. Hamiltonian-Connected Graphs with Neighborhood Unions , 2003 .