On the achromatic number of signed graphs
classification
🧮 math.CO
cs.CC
keywords
achromaticgraphsnumbersignedcoloringcompletecomputingconcept
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.