1.Using the combinatorial method of constructibility and the technique of exchanging colors, we present the best upper bounds of dynamic chromatic number of Halin graphs and SP graphs, and determine the dynamic chromatic number of a type of SP graphs, we determine the incidence chromatic number of some Descartes product graphs and some Join graphs . At last we determine the entire coloring number of 1-tree and prove a conjecture of edge-face coloring.
利用构造性组合方法和换色技巧给出了Halin图和系列平行图动态色数的最小上界，并确定了一类特殊系列平行图的动态色数，确定了某些笛卡儿积图和某些联图的关联色数，确定了1-树图的完备色数并证明了有关边面着色的一个猜想。收藏指正
尝试查询