Chromatically optimal rigid graphs
- 1 April 1989
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 46 (2) , 133-141
- https://doi.org/10.1016/0095-8956(89)90039-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Universal graphs without large bipartite subgraphsMathematika, 1984
- AMALGAMATION OF GRAPHS AND ITS APPLICATIONSAnnals of the New York Academy of Sciences, 1979
- Every finite graph is a full subgraph of a rigid graphJournal of Combinatorial Theory, Series B, 1971
- On chromatic number of graphs and set-systemsActa Mathematica Hungarica, 1966
- Symmetric relations (undirected graphs) with given semigroupsMonatshefte für Mathematik, 1965
- Universal graphs and universal functionsActa Arithmetica, 1964