| Title:
|
Orthogonal partitions and covering of graphs (English) |
| Author:
|
Poljak, Svatopluk |
| Author:
|
Rödl, Vojtěch |
| Language:
|
English |
| Journal:
|
Czechoslovak Mathematical Journal |
| ISSN:
|
0011-4642 (print) |
| ISSN:
|
1572-9141 (online) |
| Volume:
|
30 |
| Issue:
|
3 |
| Year:
|
1980 |
| Pages:
|
475,476-485 |
| Summary lang:
|
Russian |
| . |
| Category:
|
math |
| . |
| MSC:
|
05B15 |
| MSC:
|
05C70 |
| idZBL:
|
Zbl 0456.05051 |
| idMR:
|
MR583626 |
| DOI:
|
10.21136/CMJ.1980.101696 |
| . |
| Date available:
|
2008-06-09T14:40:35Z |
| Last updated:
|
2020-07-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/101696 |
| . |
| Reference:
|
[0] C. Berge: Graphs and Hypergraphs.North. Holland Publ. Company 1973. Zbl 0254.05101, MR 0357172 |
| Reference:
|
[1] R. C. Bose: On the application of the properties of Galois fields to the construction of hyper-Graeco-Latin squares.Sankhya 3 (1938), 323 - 338. |
| Reference:
|
[2] P. Erdös, Chao Ko, R. Rado: Intersection theorems for systems of finite sets.Quart. J. Math. Oxford S 12 (1961), 313-320. MR 0140419, 10.1093/qmath/12.1.313 |
| Reference:
|
[3] P. Erdös S. Chowla, E. G. Straus: On the maximal number of pairwise orthogonal Latin squares of a given order.Canad. J. Math. 12 (1960), 204-208. MR 0122730, 10.4153/CJM-1960-017-2 |
| Reference:
|
[4] P. Erdös A. W. Goodman, L. Pósa: The representation of a graph by intersections.Canad. J. Math. 18 (1966), 106-112. MR 0186575, 10.4153/CJM-1966-014-3 |
| Reference:
|
[5] M. Hall: Combinatorial Theory.Blaisdell Publishing Company, Waltham (Masachusetts), Toronto, London, 1967. Zbl 0196.02401, MR 0224481 |
| Reference:
|
[6] F. Harary: Graph Theory.Addison-Wesley 1969. Zbl 0196.27202, MR 0256911 |
| Reference:
|
[7] L. Lovasz: Kneser's conjecture, chromatic number and homotopy.J. Comb. Th. A 25, 3 (1978), 319-325. Zbl 0418.05028, MR 0514625, 10.1016/0097-3165(78)90022-5 |
| Reference:
|
[8] L. Lovasz J. Nešetřil, A. Pultr: On a product dimension of graphs.to appear in J. Comb. Th. B. |
| Reference:
|
[9] H. F. Mac Neish: Euler squares.Ann. Math., 23 (1922), 221-227. MR 1502613, 10.2307/1967920 |
| Reference:
|
[10] J. Nešetřil A. Pultr: Product and other representation of graphs and related characteristics.to appear in Proc. Conf. Algebraic Methods in Graph Theory, Szeged 1978. MR 0642062 |
| Reference:
|
[11] J. Nešetřil V. Rödl: A simple proof of the Galvin Ramsey property of the class of all finite graphs and the dimension of graphs.Discrete Math. 23 (1978), 49-55. MR 0523311, 10.1016/0012-365X(78)90186-3 |
| Reference:
|
[12] S. Poljak A. Pultr, V. Rödl: On the dimension of the Kneser graphs.to appear in Proc. Conf. Algebraic Methods in Graph Theory, Szeged 1978. MR 0642064 |
| Reference:
|
[13] S. Poljak V. Rödl: Set systems determined by intersections.to appear. MR 0611430 |
| Reference:
|
[14] S. Poljak V. Rödl: On arc chromatic number of digraphs.to appear. |
| Reference:
|
[15] S. Poljak V. Rödl, D. Turzík: Complexity of covering of edges by complete graphs.to appear. |
| . |
