1) Halin Graph
Halin图
1.
List L(p,q)-labeling Problem on Halin Graphs;
Halin图的列表L(p,q)标号
2.
Method on vertex strong total coloring of Halin graphs;
Halin图的一个点强全染色法
3.
Edge coloring with restriction of vertices and faces on Halin graphs;
Halin图的有点面约束的边染色
2) Halin Graphs
Halin图
1.
On the Distinguishing Number of Halin Graphs with △(G)=6;
△(G)=6时的Halin图的可区别数
2.
Some Results on Colouring of Halin Graphs;
关于Halin图染色方面的一些结果
3.
In this paper,we investigate cycle base structures of Halin graphs with Algebra method,and determine a series of the properties of the minimum cycle base of halin graphs.
本文用代数的思想研究了Halin图的圈基结构,并证明了Halin图的最小圈基所具备的一系列性质。
3) Halin graph
Halin-图
1.
In this paper, we study the x as(G) of Halin graphs with △A(G)≥5.
本文研究了△(G)≥5的Halin-图的邻强边色数。
2.
In this paper,we obtain the χ vs T(G) of Halin graph G(V,E) with Δ( G≤5 ) and present a conjecture as follows:If G(V,E) is a.
本文得到了 Δ(G) 5的 Halin-图 G(V。
3.
In this paper,dicusse some sufficient condition of Xr(G)=4 for Halin graphs G with (G)=3,andraised a conjecture for the sufficient and necessary condition of Xr (G)= 5 for Halin graphs G with (G)=3where (G) and Xr(G) denote the maximum degree and the total chromatic number of G respectively.
本文讨论了△（G）＝3的Halin-图的金色数Xr（G）＝4的充分条件，并提出了3－正则Halin-图Xr（G）＝5的充分必要条件的猜想，其中△（G），Xr（G）分别表示G的最大度和全色数。
4) pseudo Halin-graph
伪Halin-图
5) Pseudo-Halin graph
伪-Halin图
1.
v)≥ 3 , then G(V,E) is called a Pseudo-Halin graph; G(V,E) is said to be Halin-graph iif d(v) = 3 for every v ∈ V(f0) .
设G为2-连通平面图,若存在G的面f0,其中f0的边界构成的圈上无弦且V（f0）中的点的度至少为3,使得在G中去掉f0边界上的所有边后得到的图为除V（f0）中的点外度不小于3的树T,则称G为伪-Halin图;若V（f0）中的点全为3度点,则称G为Halin-图。
2.
If all edges on the boundary of a face f0 are removed, G become a tree T in which the degree of vertices except vertices of V(f0) is at least 3,then G is called a Pseudo-Halin graph.
若去掉f_0边界上的所有边后的到的图为除V(f_0)中的点外，所有的点不小于3的树T，称G为一伪-Halin图，称G为Halin图当且仅当所有V(f_0)中的点的度为3。
6) graph
[英][ɡræf] [美][græf]
图
1.
Prediction of disulfide bonding in protein structure based on method of graph matching;
基于图的匹配方法预测蛋白质结构中的二硫键
2.
G-design of λ-fold complete multipartite graph where G is three kinds of graphs with five points;
关于三类五点图的多重完全多部图设计
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条