2) uniquely 3-list colorable graphs
唯一3-列表可染图
1.
The paper introduces the attempt to seek some special graphs,such as K3,3 and K5 which are not unique 2-list colorable graphs and generalize a theorem which characterizes uniquely 3-list colorable graphs,depending on the definition of independent sets: suppose that G is a 2-connected graph,then G is a unique 3-list colorable graph if and only if G has an independent sets W,such that G\W is e.
运用唯一列表染色的定义找出了非唯一2-列表可染图K5和K3,3,并运用独立集的定义给出了唯一3-列表可染图的一个充要条件:设G是2-连通的图,则G是唯一3-列表可染的当且仅当存在G的一独立集W,使得G\W既不是完全图,也不是完全二分图,也不是圈。
3) uniquely 2-list colorable graphs
唯一2-列表可染图
4) list coloring
列表染色
1.
Some results on a list coloring conjecture of Reed;
关于Reed列表染色猜想的一些结果
2.
A list coloring or choice function is a proper coloring f such that f(v)∈L(v) for all v.
一个列表染色是一个真染色f，它使得f(v)∈L(v)对所有v均成立。
5) trusted list
可信列表
1.
The insufficient of current traffic identification technique was analyzed,and then a heuristic traffic identification method based on trusted list was proposed.
在分析了现有流量检测技术不足的基础上,提出了一种基于可信列表的启发式流量检测方法。
2.
Node status obtained by multi-level identification module was hashed into a table,and then a trusted list was created by this hash table.
该模型通过多级检测模块,将节点状态信息存入Hash表中,并映射形成可信列表反馈到检测端,通过活跃因子、增量因子以及连接缓存的定义,可以快速、有效识别端口跳跃及协议加密引发的P2P流量。
6) edge list coloring
边列表染色
1.
This paper gives the definition of edge list coloring and vertex list coloring and verter edeg list coloring,if G is wheel graph,then xLE(G)=△(G),xLE(G)=4,xLVE(G)=△(G)+1.
文章给出了边列表染色和顶点列表染色的定义,证明了对轮图,边选择数χLE(G)=△(G),点选择数χLE(G)=4,点边选择数χLE(G)=△(G)+1。
补充资料：[3-(aminosulfonyl)-4-chloro-N-(2.3-dihydro-2-methyl-1H-indol-1-yl)benzamide]
分子式：C16H16ClN3O3S
分子量：365.5
CAS号：26807-65-8
性质：暂无
制备方法：暂无
用途：用于轻、中度原发性高血压。
分子量：365.5
CAS号：26807-65-8
性质：暂无
制备方法：暂无
用途：用于轻、中度原发性高血压。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条