1) adjacent vertex-distinguishing
邻点可区别
1.
A total coloring approach is given for Cm×Cn graph and the adjacent vertex-distinguishing total coloring is proved.
给出了图Cm×Cn的一种全染色方法,并证明了该染色是邻点可区别的,从而得到了Cm×Cn的邻点可区别的全色数:aχt(Cm×Cn)=6。
2.
A total coloring approach is given for Pm×Cn graph and the adjacent vertex-distinguishing total coloring is proved.
给出了图Pm×Cn的一种全染色方法,证明了该染色是邻点可区别的,得到了Pm×Cn的邻点可区别全色数:xat此结果尚未见其他文献报道。
3.
Based on the classification of the degree of a graph,this paper proved that every graph without K_2 of minimum degree at least 188 permits an adjacent vertex-distinguishing 3-edge partition.
研究了图的邻点可区别边划分所需要的最少边色数。
2) adjacent strong vertex-distinguishing
邻点强可区别
1.
A total coloring approach is given for C3m×C3n、C4m×C4n graph and the adjacent strong vertex-distinguishing total coloring is proved.
给出了图C3m×C3n、C4m×C4n的一种全染色方法,并证明了该染色是邻点强可区别的,从而得到了C3m×C3n、C4m×C4n的邻点强可区别的全色数:aχst(C3m×C3n)=6、aχst(C4m×C4n)=6。
3) adjacent strong edge chromatic number of adjacent vertex-distinguish graph
邻点可区别邻强边色数
4) vertex-edge adjacent vertex-distinguishing total coloring
点边邻点可区别全色数
1.
f is a mapping from V(G)∪E(G) to {1,2,…,k},then it is called the vertex-edge adjacent vertex-distinguishing total coloring of G if uv∈E(G),f(u)≠f(uv),f(v)≠f(uv),uv∈E(G),C(u)≠C(v),and the minimum number of k is called the vertex-edge adjacent vertex-distinguishing total chromatic number of G,where C(u)={f(u)}∪{f(uv)|uv∈E(G)}.
对简单图G(V,E),存在一个正整数k,使得映射f:V(G)∪E(G)→{1,2,…,k},如果对uv∈E(G),有f(u)≠f(uv),f(v)≠f(uv),且C(u)≠C(v),则称f是图G的点边邻点可区别全染色,且称最小的数k为图G的点边邻点可区别全色数。
5) chromatic number of adjacent-position distinguishable edge coloring
邻点可区别边色数
1.
The chromatic number of adjacent-position distinguishable edge coloring of multi-joined graph S_m∨P_n∨P_n;
多重联图S_m∨P_n∨P_n的邻点可区别边色数
6) adjacent Vertex-distinguishing total coloring
邻点可区别全染色
1.
On the adjacent vertex-distinguishing total coloring of K(r,2m);
图K(r,2m)的邻点可区别全染色
2.
The adjacent vertex-distinguishing total coloring of k-multi-Mycielski the graphs;
多重Mycielski图的邻点可区别全染色
3.
On the adjacent vertex-distinguishing total coloring of some generalized Petersen graphs;
若干广义Petersen图的邻点可区别全染色
补充资料：思北邻韩二翁西邻因庵主南邻章老秀才
【诗文】：
乡闾耆宿非复前，老章病死今三年。
朝来出门为太息，不见此翁催社钱。
我比翁虽差识字，向来推择尝为吏，事功自计无一毫，尚不如翁终日醉。
【注释】：
【出处】：
乡闾耆宿非复前，老章病死今三年。
朝来出门为太息，不见此翁催社钱。
我比翁虽差识字，向来推择尝为吏，事功自计无一毫，尚不如翁终日醉。
【注释】：
【出处】：
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条