Dimension of the sum of two copies of a graph

 Access to full text

 Full (PDF)

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. MR0566696
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. (1977) MR0491363
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. (1978) 
5. J. Nešetřil V. Rödl, 10.1016/0012-365X(78)90186-3, Discerete Math. 23 (1978), 49-55. (1978) MR0523311DOI10.1016/0012-365X(78)90186-3
6. A. Pultr J. Vinárek, 10.1016/0012-365X(77)90055-3, Discrete Math. 20 (1977), 159-176. (1977) MR0485593DOI10.1016/0012-365X(77)90055-3

1. Pavel Křivka, Dimension of the sum of several copies of a graph
2. Peter Alles, Dimension of amalgamated graphs and trees