The achromatic number of Kneser graphs
Electronic Notes in Discrete Mathematics（2016）
Abstract
The achromatic number α of a graph is the largest number of colors that can be assigned to its vertices such that adjacent vertices have different color and every pair of different colors appears on the end vertices of some edge.
MoreTranslated text
Key words
Geometric graphs,complete colorings,Steiner triple systems
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined