Degree sums and spanning brooms of a graph

DOI10.1016/j.disc.2022.112966zbMath1491.05114OpenAlexW4229456613MaRDI QIDQ2144512

Yunqing Zhang, Yueyu Wu, Yaojun Chen

Publication date: 14 June 2022

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

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

zbMATH Keywords

spanning treedegree sumsbranch verticesspanning broom

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees: A survey
• Hamilton connected graphs
• On a conjecture of Bondy
• Spanning spiders and light-splitting switches
• Neighborhood unions and extremal spanning trees
• A note on Hamiltonian circuits
• Degree Conditions for Spanning Brooms
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• Relative length of long paths and cycles in graphs with large degree sums
• The binding number of a graph and its Anderson number

This page was built for publication: Degree sums and spanning brooms of a graph