De Bruijn图的均匀顶点染色和有向图线图的一个顶点染色定理

An Equitable Vertex Coloring of the De Bruijn Graph and a Vertex Coloring Theorem of Linedigraphs

给出了ｎ维ｄ进位ＤｅＢｒｕｉｊｎ图Ｂ（ｄ，ｎ）的一种均匀顶点ｄ＋１染色，即将其顶点集分拆成顶点个数至多相差１的ｄ＋１个无关集，并证明了关于一般有向图的线图的一个顶点染色定理．

The paper shows that the n-dimensional d-ary De Bruijn Graph B(d,n ) is equitable (d+ 1 )-colorable,namely,the set of d' venices of B (d,n ) can be partitioned into d+ 1A vertex coloring theorem of linedigraphs is also proved.