Geodesic
Complexity of decomposing graphs into factors with given diameters or radii
Mathematica slovaca, Tome 32 (1982) no. 4, pp. 379-388
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C70, 05C99 
@article{MASLO_1982_32_4_a8,
     author = {Plesn{\'\i}k, J\'an},
     title = {Complexity of decomposing graphs into factors with given diameters or radii},
     journal = {Mathematica slovaca},
     pages = {379--388},
     year = {1982},
     volume = {32},
     number = {4},
     mrnumber = {676574},
     zbl = {0505.05052},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1982_32_4_a8/}
}
TY  - JOUR
AU  - Plesník, Ján
TI  - Complexity of decomposing graphs into factors with given diameters or radii
JO  - Mathematica slovaca
PY  - 1982
SP  - 379
EP  - 388
VL  - 32
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1982_32_4_a8/
LA  - en
ID  - MASLO_1982_32_4_a8
ER  - 
%0 Journal Article
%A Plesník, Ján
%T Complexity of decomposing graphs into factors with given diameters or radii
%J Mathematica slovaca
%D 1982
%P 379-388
%V 32
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1982_32_4_a8/
%G en
%F MASLO_1982_32_4_a8
Plesník, Ján. Complexity of decomposing graphs into factors with given diameters or radii. Mathematica slovaca, Tome 32 (1982) no. 4, pp. 379-388. http://geodesic.mathdoc.fr/item/MASLO_1982_32_4_a8/

[1] BARANOVlČOVA Z.: On decomposition of complete 2-graphs into factors with given diameters. Acta Fac R. N. Univ. Comen. Math. 24, 1970, 175-180. | MR

[2] BEHZAD M., CHARTRAND G., LESNIAK FOSTER L.: Graphs and Digraphs Prindle. Weber and Schmidt. Boston 1979. | MR

[3] BERGE C.: Graphs and Hypergraphs. North Holland, London, 1973. | MR | Zbl

[4] BOLLOBAS B.: Extremal Graph Theory. Academic Press. New York. 1978. | MR | Zbl

[5] BOSÁK J.: Disjoint factors of diameter two in complete graphs. J. Combin. Theory B 16, 1974, 57-63. | MR | Zbl

[6] BOSÁK J., ERDOS P., ROSA A.: Decomposition of complete graphs into factors with diameter two. Mat. časop 21, 1971, 14-28. | MR

[7] BOSÁK J., ROSA A., ZNÁM Š.: On decompositions of complete graphs into factors with given diameters. In: Theory of graphs. Proc Colloq. Tihany 1966, Akademiai Kiado, Budapest, 1968, 37-56. | MR

[8] BŘEZINA J.: Použitie samočinnych počitačov pri skumani istych rozkladov kompletneho grafu. Mat časop. 23, 1973, 17-33. | MR

[9] CHVATAL V., THOMASSEN C.: Distances in orientations of graphs. J. Combin. Theory B 24, 1978, 61-75 | MR

[10] ERDÓS P., SAUER N., SCHAER J., SPENCER J.: Factorizing the complete graph into factors with large star number. J. Combin. Theory B 18, 1975, 180-183. | MR

[11] GAREY M. R., JOHNSON D.S.: Computers and Intractability. W. H. Freeman and Company. San Francisco, 1979. | MR | Zbl

[12] KAMEDA T.: On maximally distant spanning trees of a graph. Computing 17, 1976, 115-119. | MR | Zbl

[13] KOTZIG A., ROSA A.: Decomposition of complete graphs into isomorphic factors with a given diameter. Bull. London Math. Soc. 7, 1975, 51-57. | MR | Zbl

[14] LOVASZ L.: Coverings and colorings of hypergraphs. Graph Theory and Computing (Hoffman F. et al., eds.), Utilitas Mathematica, Winnipeg, 1973, 3-12. | MR | Zbl

[15] NASH-WILLIAMS C. St. J. A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 1961. 445-450. | MR | Zbl

[16] NIEPEL Ľ.: O rozklade kompletneho hypergrafu na faktory s danymi priemermi. Acta Fac. R. N. Univ. Comen. Math 34, 1979, 21-28. | MR

[17] NIEPEL Ľ.: On decomposition of complete graphs into factors with given diameters and radii. Math. Slovaca 30, 1980, 3-11. | MR

[18] PALUMBÍNY D.: On a certain type of decompositions of complete graphs into factors with equal diameters. Mat. časop. 22, 1972, 235-242. | MR | Zbl

[19] PALUMBÍNY D.: On decompositions of complete graphs into factors with equal diameters. Boll. Unione Mat. Ital. 7, 1973, 420-428. | MR | Zbl

[20] PALUMBÍNY D., ZNÁM Š.: On decompositions of complete graphs into factors with given radii. Mat. časop. 23, 1973, 306-316. | MR

[21] SAUER N.: On the factorization of the complete graph into factors of diameter 2. J. Combin. Theory 9, 1970, 423-426. | MR

[22] SAUER N., SCHAER J.: On the factorization of the complete graph. J. Combin. Theory B 14, 1973, 1-6. | MR | Zbl

[23] TOMASTA P.: Decompositions of complete k-uniform hypergraphs into factors with given diameters. Comment. Math. Univ. Carolinae 17, 1976, 377-392. | MR | Zbl

[24] TOMASTA P.: Decompositions of graphs and hypergraphs into isomorphic factors with a given diameter. Czechoslovak Math. J. 27 (102), 1977, 598-608. | MR | Zbl

[25] TOMASTA P.: On decompositions of complete k-uniform hypergraphs. Czechoslovak Math. J. 28 (103), 1978, 120-126. | MR | Zbl

[26] TOMOVÁ E.: On the decompositions of the complete directed graph into factors with given diameters. Mat. časop. 20, 1970, 257-261. | MR

[27] TOMOVÁ E.: Decomposition of complete bipartite graphs into factors with given diameters. Math. Slovaca 27, 1977, 113-128. | MR | Zbl

[28] TOMOVÁ E.: Decomposition of complete bipartite graphs into factors with given radii. Math. Slovaca 27, 1977, 231-237. | MR | Zbl

[29] TUTTE W. T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 3, 1961, 221-230. | MR | Zbl

[30] ZNÁM Š.: Decomposition of the complete directed graph into two factors with given diameters. Mat. časop. 20, 1970, 254-256. | MR | Zbl

[31] ZNÁM Š.: Decomposition of complete graphs into factors of diameter two. Math. Slovaca 30, 1980, 373-378. | MR | Zbl

[32] ZNÁM Š.: On a conjecture of Bollobás and Bosák. J. Graph. Theory 6, 1982, 139-146. | MR | Zbl