【摘要】 图的染色理论在频率分配问题及计算机科学描述空间数据库中点与点之间关系的实际问题中产生,在计算机科学等诸多领域皆有应用.文章创新思路,利用一些新的工具,比如"色集事先分配""构造染色"等新方法,对完全三部图K_3,4,p（p≥4）一般的点可区别全色数进行探讨,分段给出了当p值较大时的规律性证明,以及当p值较小时的特殊性证明,K_3,4,p一般的点可区别全色数已被完全确定.更多还原

【Abstract】 It is known for graph coloring theory that the vertex distinguishing edge/total colorings arise from the frequency distribution problems and the space database in comput-er science. The theory has been applied successively in many fields, such as computer science. In this paper, we have innovative ideas and use some new tools, such as "the method of distributing the color sets in advance", "the method of constructing the colorings" etc. With the regularity proof when the value of p is large and the particularity proof when the value of p is small, the vertex-distinguishing general total chromatic number of K_3,4,pis determined.更多还原