Homomorphisms of 3-chromatic graphs
Authors:
- Michael O AlbertsonMAMichael O Albertson
- Karen L CollinsKCKaren L Collins
- 1 April 1985
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 54 (2) , 127-132
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Color-families are denseTheoretical Computer Science, 1982
- On the complexity of the general coloring problemInformation and Control, 1981
- On predecessors of finite languagesInformation and Control, 1981
- Colorings and interpretations: a connection between graphs and grammar formsDiscrete Applied Mathematics, 1981
- The chromatic difference sequence of a graphJournal of Combinatorial Theory, Series B, 1980
- VERTEX‐TRANSITIVE GRAPHS OF ORDER 2pAnnals of the New York Academy of Sciences, 1979
- Some partitions associated with a partially ordered setJournal of Combinatorial Theory, Series A, 1976
- The structure of sperner k-familiesJournal of Combinatorial Theory, Series A, 1976
- On some strongly rigid families of graphs and the full embeddings they induceAlgebra universalis, 1974
- Symmetric relations (undirected graphs) with given semigroupsMonatshefte für Mathematik, 1965