On the achromatic number of signed graphs

Dimitri Lajou (1, 2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 UB - Université de Bordeaux

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.

Mots clés: Signed graph; Two-edge colored graph; Achromatic number; NP-Complete problem

Domaines: Combinatoire [math.CO]; Complexité [cs.CC]

Dimitri Lajou. On the achromatic number of signed graphs. Theoretical Computer Science, 2019. ⟨hal-02014469⟩