Achromatic numbers and graph operations
Date
2009-08-20T23:06:20Z
Authors
Hell, Pavol
Miller, D.J.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this paper we investigate the achromatic number of the disjoint union of graphs and the achromatic number of the categorical product of graphs. We obtain the best possible upper and lower bounds for the union of graphs and the best possible lower bound for the product of graphs. Finally we show that the achromatic number of the product of graphs is bounded above.