【摘要】 以χ２（Ｇ）记一图Ｇ之全色数，全着色Ｒａｍｓｅｙ数χ２（ｍ，ｎ）为最小正整数ｐ，使得每一ｐ阶图Ｇ或有χ２（Ｇ）≥ｍ，或其补图Ｇ满足χ２（Ｇ）≥ｎ。本文给出χ２（ｍ，ｎ）的上、下界更多还原

【Abstract】 The total chromatic number of a graph G is denoted by χ 2(G). The total chromatic Ramsey number, denoted by χ 2(m,n), is defined as the least positive integer p so as to make each graph G of order p and its complement  either χ 2(G)≥m or χ 2()≥n respectively. In this paper, some upper and lower bounds of χ 2(m,n) are given.更多还原