论文部分内容阅读
Let G be a simple graph with no isolated edge. An/-total coloring of a graphG is a mapping Ф ： V（G） U E（G） → （1, 2,…… , k） such that no adjacent vertices receive thesame color and no adjacent edges receive the same color. An/-total coloring of a graph G i