Some results on spanning trees

DOI10.1007/s10255-010-0011-4zbMath1221.05064OpenAlexW2095369952MaRDI QIDQ601948

Bing Yao, Jian-fang Wang, Zhong Fu Zhang

Publication date: 29 October 2010

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-010-0011-4

zbMATH Keywords

diameterspanning treeSteiner treeindependent numberleaves

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items

A note on graph proper total colorings with many distinguishing constraints ⋮ A new vertex distinguishing total coloring of trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A lower bound for the circumference of a graph
• A dynamic survey of graph labeling
• On bandwidth sums of graphs
• On upper bounds of bandwidths of trees
• Spanning Trees with Many Leaves
• Vertex-distinguishing proper edge-colorings
• Connected Domination and Spanning Trees with Many Leaves
• Spanning Directed Trees with Many Leaves
• Spanning trees with many leaves
• Spanning trees of bounded degree