Geodesic
Orthogonal partitions and covering of graphs
Czechoslovak Mathematical Journal, Tome 30 (1980) no. 3, pp. 475-485

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CMJ.1980.101696
Classification : 05B15, 05C70 
Poljak, Svatopluk; Rödl, Vojtěch. Orthogonal partitions and covering of graphs. Czechoslovak Mathematical Journal, Tome 30 (1980) no. 3, pp. 475-485. doi: 10.21136/CMJ.1980.101696
@article{10_21136_CMJ_1980_101696,
     author = {Poljak, Svatopluk and R\"odl, Vojt\v{e}ch},
     title = {Orthogonal partitions and covering of graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {475--485},
     year = {1980},
     volume = {30},
     number = {3},
     doi = {10.21136/CMJ.1980.101696},
     mrnumber = {583626},
     zbl = {0456.05051},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1980.101696/}
}
TY  - JOUR
AU  - Poljak, Svatopluk
AU  - Rödl, Vojtěch
TI  - Orthogonal partitions and covering of graphs
JO  - Czechoslovak Mathematical Journal
PY  - 1980
SP  - 475
EP  - 485
VL  - 30
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1980.101696/
DO  - 10.21136/CMJ.1980.101696
LA  - en
ID  - 10_21136_CMJ_1980_101696
ER  - 
%0 Journal Article
%A Poljak, Svatopluk
%A Rödl, Vojtěch
%T Orthogonal partitions and covering of graphs
%J Czechoslovak Mathematical Journal
%D 1980
%P 475-485
%V 30
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1980.101696/
%R 10.21136/CMJ.1980.101696
%G en
%F 10_21136_CMJ_1980_101696

[0] C. Berge: Graphs and Hypergraphs. North. Holland Publ. Company 1973. | MR | Zbl

[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.

[2] P. Erdös, Chao Ko, R. Rado: Intersection theorems for systems of finite sets. Quart. J. Math. Oxford S 12 (1961), 313-320. | DOI | MR

[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. | DOI | MR

[4] P. Erdös A. W. Goodman, L. Pósa: The representation of a graph by intersections. Canad. J. Math. 18 (1966), 106-112. | DOI | MR

[5] M. Hall: Combinatorial Theory. Blaisdell Publishing Company, Waltham (Masachusetts), Toronto, London, 1967. | MR | Zbl

[6] F. Harary: Graph Theory. Addison-Wesley 1969. | MR | Zbl

[7] L. Lovasz: Kneser's conjecture, chromatic number and homotopy. J. Comb. Th. A 25, 3 (1978), 319-325. | DOI | MR | Zbl

[8] L. Lovasz J. Nešetřil, A. Pultr: On a product dimension of graphs. to appear in J. Comb. Th. B.

[9] H. F. Mac Neish: Euler squares. Ann. Math., 23 (1922), 221-227. | DOI | MR

[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

[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. | DOI | MR

[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

[13] S. Poljak V. Rödl: Set systems determined by intersections. to appear. | MR

[14] S. Poljak V. Rödl: On arc chromatic number of digraphs. to appear.

[15] S. Poljak V. Rödl, D. Turzík: Complexity of covering of edges by complete graphs. to appear.

Cité par Sources :