特殊图类的非正常染色

Improper Coloring of the Special Graphs

摘要: 设k，l是非负整数，图G的一个非正常(k, l)-染色是指用红蓝2种颜色对顶点集V(G)进行着色，使得对每一个染以红色(或蓝色)的点，至多k (或l)个邻点与其染色相同。本文主要研究路和圈的平方图的非正常(k, l)-染色。

Abstract: Let k, l be two non-negative integers. An improper (k, l)-coloring of a graph G refers to color the vertex set of V(G) with two colors, such that for each vertex with color red (or blue) has at most k (or l) neighbors of the same color with it. This paper focuses on improper (k, l)-coloring of square graphs of paths and cycles.