45
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

On the pseudoachromatic number of join of graphs

, &
Pages 1131-1137 | Published online: 15 Sep 2010
 

Given an undirected graph G = (V, E), with vertex set V and edge set E, the pseudoachromatic number ψ(G) of the graph G is the maximum number of colors used to color the vertices in such a way that, for any given pair of colors i, j there exists an edge e = (u, v) ∈ E(G) such that u is colored i and v is colored j. In this paper we give a complete characterization of when the ψ of the join of any two graphs is the sum of the ψ of the two graphs.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.