On ascending subgraph decomposition of graphs

References

• Y. Alavi, A. J. Boals, G. Chartrand, P. Erdös, and O. R. Oellermann, The ascending subgraph decomposition problem, Congressus Numerantium, 58 (1987), 7–14.
   Google Scholar
• K. Ando, S. Gervacio, M. Kano, Disjoint integer subsets having a constant sum, Discrete Mathematics, 82 (1990), 7–11. doi: 10.1016/0012-365X(90)90040-O
   Web of Science ®Google Scholar
• W. Cao and P. Hamburger, Solution of Fink & Straight Conjecture on Path-Perfect Complete Bipartite Graphs, Journal of Graph Theory, 55 (2007), 91–111. doi: 10.1002/jgt.20225
   Web of Science ®Google Scholar
• G. Chang,: On the ascending subgraph decompositon of graph with size q<21, Qufu Normal University, Thesis of Master, 2002.
   Google Scholar
• H. Chen, On the ascending subgraph decomposition into matchings, Journal of Mathematical Research and Exposition, 14 (1) (1994), 61–64.
   Google Scholar
• H. Chen and K. Ma, On a new subgraph decomposition problem, Utilitas Mathematica, 37(1990), 265–270.
   Web of Science ®Google Scholar
• H. Chen and K. Ma, On the ascending subgraph decompositions of regular graphs, Appl. Math. J. Chinese Univ. Ser. B, 13(2)(1998), 165–170. doi: 10.1007/s11766-998-0037-z
   Google Scholar
• F. Chen, H. Fu, Y. Wang and J. Zhou, Partition of a set of integers into subsets with prescribed sums, Taiwanese Journal of Mathematics, 9 (4) (2005), 629–638. doi: 10.11650/twjm/1500407887
   Web of Science ®Google Scholar
• K. B. Chilakamarri, Decomposition of bipartite graphs into paths, American Mathematical Monthly, 95(7)(1988), 634–636. doi: 10.2307/2323307
   Web of Science ®Google Scholar
• K. B. Chilakamarri and P. Hamburger, A note on packing paths into complete bipartite graphs, Bull Inst Combinatorics and its Applications, 4 (1992), 32–34.
   Google Scholar
• R. J. Faudree, A. Gyárfás, and R. H. Schelp, Graphs which have an ascending subgraph decomposition, Congressus Numerantium, 59 (1987), 49–54.
   Google Scholar
• R. J. Faudree, R. Gould, M. S. Jacobson and L. Lesniak, Graphs with an ascending subgraph decomposition, Congressus Numerantium, 65(1988), 33–42.
   Google Scholar
• R. J. Faudree and R. Gould, An Ascending Subgraph Decomposition for Forests, Congressus Numerantium, 70(1990), 221–230.
   Google Scholar
• J. F. Fink and H. J. Straight, A note on path-perfect graphs, Discrete Mathematics, 33(1981), 95–98. doi: 10.1016/0012-365X(81)90262-4
   Web of Science ®Google Scholar
• H. Fu, A note on the ascending subgraph decomposition problem, Discrete Mathematics, 84 (1990), 315–318. doi: 10.1016/0012-365X(90)90137-7
   Web of Science ®Google Scholar
• H. Fu, Some results on the ascending subgraph decomposition, Bull. Inst. Math. Acad. Sin., 16(4)(1988), 341–345.
   Google Scholar
• H. Fu and W. Hu, Two classes of graphs which have ascending sub-graph decompositions, Ars Combin., 35-A (1993), 65–70.
   Google Scholar
• H. Fu and W. Hu, A note on ascending subgraph decompositions of complete multipartite graphs, Discrete Mathematics, 226 (2001), 397–402. doi: 10.1016/S0012-365X(00)00171-0
   Web of Science ®Google Scholar
• H. Fu and W. Hu, Ascending subgraph decompositions of regular graphs, Discrete Mathematics, 253 (2002), 11–18. doi: 10.1016/S0012-365X(01)00445-9
   Web of Science ®Google Scholar
• Z. Guo, On the ascending subgraph decompositon of Kn-H2n+1, Mathematica Applicata, 1(1999), 15–18.
   Google Scholar
• W. Hu and H. Fu, Partition a graph into ascending subgraphs, Utilitas Mathematica, 36(1989), 97–105.
   Web of Science ®Google Scholar
• A. Lladó and J. Moragas, On the Sumset Partition Problem, Electronic Notes in Discrete Mathematics, 34 (2009), 15–19. doi: 10.1016/j.endm.2009.07.003
   Google Scholar
• A. Lladó and J. Moragas,: On the ASD conjecture.
   Google Scholar
• K. Ma and J. Zhou, On Alavi’s conjecture about ascending subgraph decomposition, Advances in Mathematics, 22(4)(1993), 332–339.
   Google Scholar
• K. Ma, H. Zhou and J. Zhou, On the ascending star subgraph decomposition of star forest, Combinatorica, 14(3) (1994), 307–320. doi: 10.1007/BF01212979
   Web of Science ®Google Scholar
• K. Ma and H. Chen, Some Graphs Which have an Ascending Subgraph Decomposition, Advances in Mathematics, 26(1)(1997), 66–71.
   Google Scholar
• K. Ma and Y. Zhang, The ascending Subgraph Decomposition of Kn- H2n-1, Systems Science and Mathematical Sciences, 4(1997), 356–360.
   Google Scholar
• K. Ma and X. Wang, On the ascending subgraph decompositions problem, Advances in Mathematics, 28(3)(1999), 269–270.
   Google Scholar
• L. Sun, Two new results on ascending subgraph decomposition, Journal of Qufu Normal University, 2(1998), 51–55.
   Google Scholar
• M. Truszczyński, Note on the decomposition of λKm,n (λK*m,n) into paths, Discrete Mathematics, 55(1)(1985), 89–96. doi: 10.1016/S0012-365X(85)80023-6
   Google Scholar
• V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz., 3 (1964), 25–30.
   Google Scholar
• X. Wang, On the ascending subgraph decompositon of Kn-H2n+2, Qufu Normal University, thesis of Master, 1999.
   Google Scholar
• N. Xing, Z. Xie and J. Li, The ascending subgraph decomposition of bipartite graph Km1, m2 – Hm2, Comm. On Appl. Math. and Comput., 17(2)(2003), 85–90.
   Google Scholar
• M. Xu and K. Ma, On the ascending subgraph decomposition of Kn-H2n+i (i=1,2), Journal of Mathematical Research and Exposition, 22(1)(2002), 71–75.
   Google Scholar
• S. Zaks and C. L. Liu, Decomposition of graphs into trees, Congressus Numerantium, 19(1977), 643–654.
   Google Scholar
• G. Zhao, Z. Wang, F. Xu and H. Dong, The ascending subgraph decomposition of Kn-H5n/2–4, J. Sys. Sci. & Math. Scis., 22(1)(2002), 14–28.
   Google Scholar
• G. Zhao, H. Dong, Z. Wang and F. Xu, The ascending subgraph decomposition problem, Chinese Quarterly Journal of Mathematics, 14(2) (1999), 52–58.
   Google Scholar
• X. Zhou, Y. Su and K. Ma, Some graphs which have ascending subgraph decomposition, ACTA Mathematicae Applicatae Sinica, 4(1999), 396–400.
   Google Scholar