×

On the dimension of trees. (English) Zbl 0476.05075


MSC:

05C99 Graph theory
05C05 Trees
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Křivka, P., The dimension of odd cycles and cartesian cubes, Szeged. Szeged, Proc. Conf. Algebraic Methods in Graph Theory (1978), to appear · Zbl 0476.05078
[2] Kučera, L.; Nešetřil, J.; Pultr, A., Complexity of dimension three and some related edge-covering characteristics of graphs, Theor. Comp. Science, 11, 93-106 (1980) · Zbl 0442.68031
[3] L. Lovǎsz, J. Nešetřil and A. Pultr, On a product dimension of graphs, to appear in J. Combinatorial Theory.; L. Lovǎsz, J. Nešetřil and A. Pultr, On a product dimension of graphs, to appear in J. Combinatorial Theory.
[4] Nešetřil, J.; Pultr, A., A Dushnik-Miller type dimension of graphs and its complexity, (Fundamentals of Computation Theory, 50 (1977), Springer-Verlag: Springer-Verlag Berlin), 482-493, Lecture Notes in Comp. Sci. · Zbl 0362.05073
[5] Nešetřil, J.; Rödl, V., A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of graphs, Discrete Math., 23, 49-55 (1978) · Zbl 0388.05036
[6] Poljak, S.; Pultr, A.; Rödl, V., On the dimension of the Kneser graphs, Szeged. Szeged, Proc. Conf. Algebraic Methods in Graph Theory (1978), to appear
[7] S. Poljak, A. Pultr and V. Rödl, On a product dimension of bipartite graphs, submitted to J. Graph Theory.; S. Poljak, A. Pultr and V. Rödl, On a product dimension of bipartite graphs, submitted to J. Graph Theory. · Zbl 0531.05038
[8] Pultr, A., On productive classes of graphs determined by prohibiting given subgraphs, (Hajnal, A.; Sós, V. T., Combinatorics Colloq. Math. Soc. János Bolyai, Vol. 18 (1978), North-Holland: North-Holland Amsterdam), 805-820 · Zbl 0392.05028
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.