Previous |  Up |  Next

Article

References:
[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 0566696
[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 0491363
[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 10.1016/0012-365X(78)90186-3 | MR 0523311
[6] A. Pultr J. Vinárek: Productive classes and subdirect irreducibility, in particular for graphs. Discrete Math. 20 (1977), 159-176. DOI 10.1016/0012-365X(77)90055-3 | MR 0485593
Partner of
EuDML logo