graphs相关论文
...
There exist many differences in the process of compiling “reader-friendly” between the two textbooks, including the me......
设G是简单图,图G的一个k-点可区别Ⅳ-全染色(简记为k-VDIVT染色)f是指一个从V(G)∪E(G)到{1,2,…,k}的映射,满足:(V)uv,uw∈E(G),u......
本文我们证明如下结果:设G=(V,E)是一个n(n≥3)阶k-连通(k≥2)图,记X1,X2,…,Xk为V的子集,X=X1∪X2∪…∪Xk.若对每个I,I=1,2,…,k......
Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V(G) ∪ ......

