On the achromatic number of signed graphs

Dimitri Lajou

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment