Concerning the achromatic number of graphs
Journal of Combinatorial Theory Series B
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
On the edge achromatic numbers of complete graphs
Discrete Mathematics - Graph colouring and variations
Extremal graphs in some coloring problems
Discrete Mathematics
On the existence of graphs with prescribed coloring parameters
Discrete Mathematics
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the minimum monochromatic or multicolored subgraph partition problems
Theoretical Computer Science
| Hi-index | 5.23 |
In this paper we have investigated mainly the three colouring parameters of a graph G, viz., the chromatic number, the achromatic number and the pseudoachromatic number. The importance of their study in connection with the computational complexity, partitions, algebra, projective plane geometry and analysis were briefly surveyed. Some new results were found along these directions. We have rede0ned the concept of perfect graphs in terms of these parameters and obtained a few results. Some open problems are raised.