EDP Sciences logo
Submit your paper
Search
Menu
All issues Volume 28 / No 3 (June 2023) Wuhan Univ. J. Nat. Sci., 28 3 (2023) 221-222 References
Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 28, Number 3, June 2023
Page(s) 221 - 222
DOI https://doi.org/10.1051/wujns/2023283221
Published online 13 July 2023
  1. Woźniak M. Packing of graphs—A survey [J]. Discrete Mathematics, 2004, 276: 379-391. [CrossRef] [MathSciNet] [Google Scholar]
  2. Yap H P. Packing of graphs—A survey [J]. Discrete Mathematics, 1988, 38: 395-404. [CrossRef] [MathSciNet] [Google Scholar]
  3. Gyárfás A , Lehel J. Packing trees of different order into Formula [J]. Combinatorics (Proc Fifth Hungarian Colloquia, Keszthely, 1976), Colloquia Mathematica Societatis Ja˙nos Bolyai, 1978, 18: 463-469. [Google Scholar]
  4. Bollobás B. Some remarks on packing trees [J]. Discrete Mathematics, 1983, 46(2): 203-204. [CrossRef] [MathSciNet] [Google Scholar]
  5. Hobbs A M, Bourgeois B A, Kasiraj J. Packing trees in complete graphs [J]. Discrete Mathematics, 1987, 67(1): 27-42. [CrossRef] [MathSciNet] [Google Scholar]
  6. Yuster R. On packing trees into complete bipartite graphs [J]. Discrete Mathematics, 1997, 163(1-3): 325-327. [CrossRef] [MathSciNet] [Google Scholar]
  7. Wang H. Packing three copies of a tree into a complete bipartite graph [J]. Annals of Combinatorics, 2009, 13(2): 261-269. [CrossRef] [MathSciNet] [Google Scholar]
  8. Wang H. Packing two forests into a bipartite graph [J]. Journal of Graph Theory, 1996, 23(2): 209-213. [CrossRef] [MathSciNet] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.