论文标题
图形的发病率有缺陷
Defective incidence coloring of graphs
论文作者
论文摘要
我们定义了图形的$ D $ fefective Intiments色彩数字，概括了入射率的概念，并确定了某些图形，包括树，完整的两部分图，完整的图形和外平面图。提出了用于构建这些图形的最佳$ D $缺陷入射颜色的快速算法。
We define the $d$-defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and outerplanar graphs. Fast algorithms for constructing the optimal $d$-defective incidence colorings of those graphs are presented.
