Concerning the achromatic number of graphs
- 1 February 1986
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 40 (1) , 21-39
- https://doi.org/10.1016/0095-8956(86)90062-6
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A lower estimate for the achromatic number of irreducible graphsDiscrete Mathematics, 1981
- On the complexity of the general coloring problemInformation and Control, 1981
- Edge Dominating Sets in GraphsSIAM Journal on Applied Mathematics, 1980
- GRAPHS WITH FORBIDDEN HOMOMORPHIC IMAGESAnnals of the New York Academy of Sciences, 1979
- Graph with given achromatic numberDiscrete Mathematics, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Eigenvalues and partitionings of the edges of a graphLinear Algebra and its Applications, 1972