AMALGAMATION OF GRAPHS AND ITS APPLICATIONS
- 1 May 1979
- journal article
- Published by Wiley in Annals of the New York Academy of Sciences
- Vol. 319 (1) , 415-428
- https://doi.org/10.1111/j.1749-6632.1979.tb32819.x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graphDiscrete Mathematics, 1978
- Gradual partition of a graph into complete graphsČasopis pro pěstování matematiky, 1978
- Partitions of finite relational and set systemsJournal of Combinatorial Theory, Series A, 1977
- The Ramsey property for graphs with forbidden complete subgraphsJournal of Combinatorial Theory, Series B, 1976
- Applications of product colouringActa Mathematica Hungarica, 1974
- Graphs and k-SocietiesCanadian Mathematical Bulletin, 1970
- Graphs with Monochromatic Complete Subgraphs in Every Edge ColoringSIAM Journal on Applied Mathematics, 1970
- On chromatic number of finite set-systemsActa Mathematica Hungarica, 1968
- Symmetric relations (undirected graphs) with given semigroupsMonatshefte für Mathematik, 1965
- An Application of Ramsay's Theorem to a Problem of Erdos and HajnalCanadian Mathematical Bulletin, 1965