Representations of graphs by means of products and their complexity
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On a product dimension of graphsJournal of Combinatorial Theory, Series B, 1980
- Complexity of dimension three and some related edge-covering characteristics of graphsTheoretical Computer Science, 1980
- On classes of relations and graphs determined by subobjects and factorobjectsDiscrete Mathematics, 1978
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graphDiscrete Mathematics, 1978
- Productive classes and subdirect irreducibility, in particular for graphsDiscrete Mathematics, 1977
- Applications of product colouringActa Mathematica Hungarica, 1974
- On the cancellation law among finite relational structuresPeriodica Mathematica Hungarica, 1971