加载中…
2019-02-13
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本