摘要
图的顶点C划分是指 :G的顶点划分 {V1,V2 ,… ,Vk} ,使得每个G[Vi]为多重完全图 (1≤i≤k) .结合图的顶点C划分的条件 ,确定了一类点的度在modulo 4下值为 0或 3的上可嵌入图类 ,综合已有结果 ,较完整地刻画了这类图的上可嵌入情况 .
Let G be a graph,if there exists a partition {V 1,V 2,…,V k} of V(G) satisfying G[V i] a multiple complete graph for any i∈[1,k],then G has a C-partition.Combined with the condition of C-partition,it gives classes of upper-embeddable graphs whose value of degree of each vertex is 0 or 3,respectively,under modulo 4.Based on the known results,it characterizes entirely the upper embeddability of such classes of graphs.
出处
《河北师范大学学报（自然科学版）》
CAS
2003年第5期438-440,共3页
Journal of Hebei Normal University：Natural Science
基金
重庆市教育委员会自然科学基金资助项目 ( 0 10 2 0 4)
