Some results on spanning trees
From MaRDI portal
Publication:601948
DOI10.1007/S10255-010-0011-4zbMATH Open1221.05064OpenAlexW2095369952MaRDI QIDQ601948FDOQ601948
Authors: Bing Yao, Zhongfu Zhang, Jianfang Wang
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
Recommendations
Cites Work
- A dynamic survey of graph labeling
- Graph theory with applications
- Spanning Trees with Many Leaves
- Title not available (Why is that?)
- Vertex-distinguishing proper edge-colorings
- Connected Domination and Spanning Trees with Many Leaves
- On bandwidth sums of graphs
- Spanning directed trees with many leaves
- A lower bound for the circumference of a graph
- Spanning trees of bounded degree
- Spanning trees with many leaves
- On upper bounds of bandwidths of trees
Cited In (10)
- A note on graph proper total colorings with many distinguishing constraints
- Snarks with special spanning trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some results on higher Suslin trees
- A new vertex distinguishing total coloring of trees
- Title not available (Why is that?)
- A note on total excess of spanning trees
- Extension of spanning tree and applications
- Emerging spanning trees in the work of Candilis-Josic-Woods
This page was built for publication: Some results on spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q601948)