Some results on spanning trees
From MaRDI portal
Publication:601948
Recommendations
Cites work
- scientific article; zbMATH DE number 1305468 (Why is no real title available?)
- A dynamic survey of graph labeling
- A lower bound for the circumference of a graph
- Connected Domination and Spanning Trees with Many Leaves
- Graph theory with applications
- On bandwidth sums of graphs
- On upper bounds of bandwidths of trees
- Spanning Trees with Many Leaves
- Spanning directed trees with many leaves
- Spanning trees of bounded degree
- Spanning trees with many leaves
- Vertex-distinguishing proper edge-colorings
Cited in
(12)- A new vertex distinguishing total coloring of trees
- A note on total excess of spanning trees
- Snarks with special spanning trees
- On graph proper total colorings with labelling-type restrictions
- Some results on higher Suslin trees
- Extension of spanning tree and applications
- Spanning trees with small diameters
- Existence of a spanning tree having small diameter
- scientific article; zbMATH DE number 3855138 (Why is no real title available?)
- A note on graph proper total colorings with many distinguishing constraints
- scientific article; zbMATH DE number 7132826 (Why is no real title available?)
- 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)