论文信息 - The spectrum of optimal excess graphs for trees with up to four edges - 字舞流文

The spectrum of optimal excess graphs for trees with up to four edges

In 1978, Huang and Rosa solved the spectrum problem for decomposition for trees with up to eight edges. Also, the packing and covering problems were settled for trees with up to six edges by Roditt...

Nabil Shalaby | Danny Dyer | Sadegheh Haghshenas

[1] J. Plücker. System der analytischen Geometrie : auf neue Betrachtungsweisen gegründet, und insbesondere eine ausführliche Theorie der Curven dritter Ordnung enthaltend , .

[2] D. West. Introduction to Graph Theory , 1995 .

[3] Yehuda Roditty. Packing and Covering of the Complete Graph with a Graph G of Four Vertices or Less , 1983, J. Comb. Theory, Ser. A.

[4] Y. Roditty. THE PACKING AND COVERING OF THE COMPLETE GRAPH I: THE FORESTS OF ORDER FIVE , 1986 .

[5] Nabil Shalaby,et al. Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges , 2016, Graphs Comb..

[6] David Coudert,et al. On DRC‐covering of Kn by cycles , 2003 .

[7] Janie Ailor Kennedy. Maximum packings of K n with hexagons. , 1993 .

[8] Janie Ailor Kennedy. Corrigendum: Maximum packings of Kn with hexagons , 1994, Australas. J Comb..