Geodesic
Dimension of the sum of two copies of a graph
Czechoslovak Mathematical Journal, Tome 31 (1981) no. 4, pp. 514-520
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1981.101770
Classification : 05C35, 05C99 
@article{10_21136_CMJ_1981_101770,
     author = {K\v{r}ivka, Pavel},
     title = {Dimension of the sum of two copies of a graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {514--520},
     year = {1981},
     volume = {31},
     number = {4},
     doi = {10.21136/CMJ.1981.101770},
     mrnumber = {631599},
     zbl = {0484.05053},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101770/}
}
TY  - JOUR
AU  - Křivka, Pavel
TI  - Dimension of the sum of two copies of a graph
JO  - Czechoslovak Mathematical Journal
PY  - 1981
SP  - 514
EP  - 520
VL  - 31
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101770/
DO  - 10.21136/CMJ.1981.101770
LA  - en
ID  - 10_21136_CMJ_1981_101770
ER  - 
%0 Journal Article
%A Křivka, Pavel
%T Dimension of the sum of two copies of a graph
%J Czechoslovak Mathematical Journal
%D 1981
%P 514-520
%V 31
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101770/
%R 10.21136/CMJ.1981.101770
%G en
%F 10_21136_CMJ_1981_101770
Křivka, Pavel. Dimension of the sum of two copies of a graph. Czechoslovak Mathematical Journal, Tome 31 (1981) no. 4, pp. 514-520. doi: 10.21136/CMJ.1981.101770

[1] L. Kučera J. Nešetřil A. Pultr: Complexity of dimension three and some related edge-covering characteristic of graphs. to appear in Theoretical Comp. Science. | MR

[2] L. Lovasz J. Nešetřil A. Pultr: On a product dimension of graphs. to appear in J. Comb. Theory (B).

[3] J. Nešetřil A. Pultr: A Dushnik-Miller type dimension of graphs and its complexity. Proc. of the Conf. on Fundamentals of Computation Theory, Lecture Notes in Comp. Science 56, Springer 1977, 482-493. | MR

[4] J. Nešetřil A. Pultr: Product and other representations of graphs and related characteristics, submitted to Proceed. of the Confer. Algebraic methods and graph theory, Szeged 1978.

[5] J. Nešetřil V. Rödl: A simple proof of the Galvin-Ramsey property of graphs and a dimension of a graph. Discerete Math. 23 (1978), 49-55. | DOI | MR

[6] A. Pultr J. Vinárek: Productive classes and subdirect irreducibility, in particular for graphs. Discrete Math. 20 (1977), 159-176. | DOI | MR

Cité par Sources :