On the achromatic number of signed graphs

02/13/2019
by   Dimitri Lajou, et al.
0

In this paper, we generalize the concept of complete coloring and achromatic number to 2-edge-colored graphs and signed graphs. We give some useful relationships between different possible definitions of such achromatic numbers and prove that computing any of them is NP-complete.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset