×

Dimension of the sum of two copies of a graph. (English) Zbl 0484.05053


MSC:

05C99 Graph theory
PDFBibTeX XMLCite
Full Text: EuDML

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. · Zbl 0442.68031
[2] L. Lovasz J. Nešetřil A. Pultr: On a product dimension of graphs. to appear in J. Comb. Theory
[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. · Zbl 0362.05073
[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. · Zbl 0388.05036
[6] A. Pultr J. Vinárek: Productive classes and subdirect irreducibility, in particular for graphs. Discrete Math. 20 (1977), 159-176. · Zbl 0412.18006
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.