A lower estimate for the achromatic number of irreducible graphs
- 31 December 1981
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 33 (2) , 171-183
- https://doi.org/10.1016/0012-365x(81)90164-3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Graph with given achromatic numberDiscrete Mathematics, 1976
- Eigenvalues and partitionings of the edges of a graphLinear Algebra and its Applications, 1972
- Combinatorial Theorems on Classifications of Subsets of a Given SetProceedings of the London Mathematical Society, 1952