We introduce the concept of deficiency in signed graphs. The deficiency of a coloration is the number of unused colors. We classify the deficiency of 2-chromatic graphs. There are four decision problems about the minimum and maximum deficiency of a 3-chromatic signed graph. We answer two of them with a polynomial-time algorithm for deciding the maximum deficiency of a 3-chromatic signed graph.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。