Publication:2857407
From MaRDI portal
zbMath1274.05070MaRDI QIDQ2857407
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001624
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Cites Work
- Unnamed Item
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
- Trees having an even or quasi even degree sequence are graceful
- On a conjecture of Graham and Häggkvist with the polynomial method
- The distribution of degrees in a large random tree
- New families of graphs that have \(\alpha\)-labelings
- Additive Latin transversals.
- Packing and decomposition of graphs with trees
- \(\rho\)-valuations for some stunted trees
- Edge-decompositions ofKn,ninto isomorphic copies of a given tree
- The distribution of nodes of given degree in random trees
- Distinct Sums Modulo n and Tree Embeddings