| Title:
|
Complexity of decomposing graphs into factors with given diameters or radii (English) |
| Author:
|
Plesník, Ján |
| Language:
|
English |
| Journal:
|
Mathematica Slovaca |
| ISSN:
|
0139-9918 |
| Volume:
|
32 |
| Issue:
|
4 |
| Year:
|
1982 |
| Pages:
|
379-388 |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C70 |
| MSC:
|
05C99 |
| idZBL:
|
Zbl 0505.05052 |
| idMR:
|
MR676574 |
| . |
| Date available:
|
2009-09-25T09:24:25Z |
| Last updated:
|
2012-08-01 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/136306 |
| . |
| Reference:
|
[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 0294153 |
| Reference:
|
[2] BEHZAD M., CHARTRAND G., LESNIAK FOSTER L.: Graphs and Digraphs Prindle.Weber and Schmidt. Boston 1979. MR 0525578 |
| Reference:
|
[3] BERGE C.: Graphs and Hypergraphs.North Holland, London, 1973. Zbl 0254.05101, MR 0357172 |
| Reference:
|
[4] BOLLOBAS B.: Extremal Graph Theory.Academic Press. New York. 1978. Zbl 0419.05031, MR 0506522 |
| Reference:
|
[5] BOSÁK J.: Disjoint factors of diameter two in complete graphs.J. Combin. Theory B 16, 1974, 57-63. Zbl 0256.05117, MR 0351901 |
| Reference:
|
[6] BOSÁK J., ERDOS P., ROSA A.: Decomposition of complete graphs into factors with diameter two.Mat. časop 21, 1971, 14-28. MR 0321798 |
| Reference:
|
[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 0233720 |
| Reference:
|
[8] BŘEZINA J.: Použitie samočinnych počitačov pri skumani istych rozkladov kompletneho grafu.Mat časop. 23, 1973, 17-33. MR 0325459 |
| Reference:
|
[9] CHVATAL V., THOMASSEN C.: Distances in orientations of graphs.J. Combin. Theory B 24, 1978, 61-75 MR 0491326 |
| Reference:
|
[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 0364021 |
| Reference:
|
[11] GAREY M. R., JOHNSON D.S.: Computers and Intractability.W. H. Freeman and Company. San Francisco, 1979. Zbl 0411.68039, MR 0519066 |
| Reference:
|
[12] KAMEDA T.: On maximally distant spanning trees of a graph.Computing 17, 1976, 115-119. Zbl 0335.05102, MR 0424597 |
| Reference:
|
[13] KOTZIG A., ROSA A.: Decomposition of complete graphs into isomorphic factors with a given diameter.Bull. London Math. Soc. 7, 1975, 51-57. Zbl 0308.05128, MR 0369175 |
| Reference:
|
[14] LOVASZ L.: Coverings and colorings of hypergraphs.Graph Theory and Computing (Hoffman F. et al., eds.), Utilitas Mathematica, Winnipeg, 1973, 3-12. Zbl 0322.05114, MR 0363980 |
| Reference:
|
[15] NASH-WILLIAMS C. St. J. A.: Edge-disjoint spanning trees of finite graphs.J. London Math. Soc. 36, 1961. 445-450. Zbl 0102.38805, MR 0133253 |
| Reference:
|
[16] NIEPEL Ľ.: O rozklade kompletneho hypergrafu na faktory s danymi priemermi.Acta Fac. R. N. Univ. Comen. Math 34, 1979, 21-28. MR 0568331 |
| Reference:
|
[17] NIEPEL Ľ.: On decomposition of complete graphs into factors with given diameters and radii.Math. Slovaca 30, 1980, 3-11. MR 0568209 |
| Reference:
|
[18] PALUMBÍNY D.: On a certain type of decompositions of complete graphs into factors with equal diameters.Mat. časop. 22, 1972, 235-242. Zbl 0247.05160, MR 0351894 |
| Reference:
|
[19] PALUMBÍNY D.: On decompositions of complete graphs into factors with equal diameters.Boll. Unione Mat. Ital. 7, 1973, 420-428. Zbl 0264.05124, MR 0325465 |
| Reference:
|
[20] PALUMBÍNY D., ZNÁM Š.: On decompositions of complete graphs into factors with given radii.Mat. časop. 23, 1973, 306-316. MR 0340113 |
| Reference:
|
[21] SAUER N.: On the factorization of the complete graph into factors of diameter 2.J. Combin. Theory 9, 1970, 423-426. MR 0278987 |
| Reference:
|
[22] SAUER N., SCHAER J.: On the factorization of the complete graph.J. Combin. Theory B 14, 1973, 1-6. Zbl 0253.05144, MR 0313129 |
| Reference:
|
[23] TOMASTA P.: Decompositions of complete k-uniform hypergraphs into factors with given diameters.Comment. Math. Univ. Carolinae 17, 1976, 377-392. Zbl 0327.05129, MR 0472607 |
| Reference:
|
[24] TOMASTA P.: Decompositions of graphs and hypergraphs into isomorphic factors with a given diameter.Czechoslovak Math. J. 27 (102), 1977, 598-608. Zbl 0384.05048, MR 0472608 |
| Reference:
|
[25] TOMASTA P.: On decompositions of complete k-uniform hypergraphs.Czechoslovak Math. J. 28 (103), 1978, 120-126. Zbl 0375.05044, MR 0480170 |
| Reference:
|
[26] TOMOVÁ E.: On the decompositions of the complete directed graph into factors with given diameters.Mat. časop. 20, 1970, 257-261. MR 0309789 |
| Reference:
|
[27] TOMOVÁ E.: Decomposition of complete bipartite graphs into factors with given diameters.Math. Slovaca 27, 1977, 113-128. Zbl 0357.05066, MR 0476588 |
| Reference:
|
[28] TOMOVÁ E.: Decomposition of complete bipartite graphs into factors with given radii.Math. Slovaca 27, 1977, 231-237. Zbl 0357.05067, MR 0536139 |
| Reference:
|
[29] TUTTE W. T.: On the problem of decomposing a graph into n connected factors.J. London Math. Soc. 3, 1961, 221-230. Zbl 0096.38001, MR 0140438 |
| Reference:
|
[30] ZNÁM Š.: Decomposition of the complete directed graph into two factors with given diameters.Mat. časop. 20, 1970, 254-256. Zbl 0206.52802, MR 0309790 |
| Reference:
|
[31] ZNÁM Š.: Decomposition of complete graphs into factors of diameter two.Math. Slovaca 30, 1980, 373-378. Zbl 0462.05052, MR 0595298 |
| Reference:
|
[32] ZNÁM Š.: On a conjecture of Bollobás and Bosák.J. Graph. Theory 6, 1982, 139-146. Zbl 0497.05049, MR 0655199 |
| . |
