Abstract
The pseudoachromatic number of a graph G is the maximum size of a vertex partition of G (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there is at least one edge of G. This parameter is determined for graphs such as cycles, paths, wheels, certain complete multipartite graphs, and for other classes of graphs. Some open problems are raised.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS Subject Classification (1991): primary 05C75 secondary 05C85
About this article
Cite this article
Yegnanarayanan, V. The Pseudoachromatic Number of a Graph. SEA bull. math. 24, 129–136 (2000). https://doi.org/10.1007/s10012-000-0129-z
Issue Date:
DOI: https://doi.org/10.1007/s10012-000-0129-z