On the achromatic number of signed graphs
Combinatorics
2019-02-14 v1 Computational Complexity
Abstract
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.
Keywords
Cite
@article{arxiv.1902.04828,
title = {On the achromatic number of signed graphs},
author = {Dimitri Lajou},
journal= {arXiv preprint arXiv:1902.04828},
year = {2019}
}