slnsf

摘要： In this section, we will introduce some kinds of total colorings. Total coloring of graphs (p,1)-Total Labelling Neighbor sum distinguishing total col 阅读全文

摘要： In this section, we focus on two kinds of edge colorings, which are proper vertex coloring and adjacent vertex distinguishing edge coloring. proper ve 阅读全文

摘要： We will introduce some kinds of vertex colorings, which are my main research topics over the past five years. proper vertex coloring of graphs . Acycl 阅读全文

摘要： Firstly, we introduce Euler Formula. When we use Euler formula, we often need its transformations. Secondly, we design some discharging rules based on 阅读全文

摘要： A planar graph is a graph that can be drawn on a plane in such a way that no edges cross each other, and this drawing is a plane graph. For example, i 阅读全文