浏览全部资源
扫码关注微信
青海师范大学数学系,青海,西宁,810008
纸质出版：2002
移动端阅览
[1]冶成福.s—桥图的色惟一性[J].新疆大学学报(自然科学版),2002(03):261-265.
冶成福. s—桥图的色惟一性[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2002, (3).
[1]冶成福.s—桥图的色惟一性[J].新疆大学学报(自然科学版),2002(03):261-265. DOI：
冶成福. s—桥图的色惟一性[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2002, (3). DOI：
由连接两个顶点的 s条内部不交的路组成的图叫 s-桥图 .记作 F (k1
k2
…
ks)
本文讨论了此类图的色性
给出了此类图色惟一的一个充分条件 .并证明了 t+2—桥图 Ft(2
2
a
b)是色惟一的 .
The graph \$F(k\-1
k\-2
...
k\-s)\$ consisting of s paths joining two vertices is called a s-bridge graph.In this papes the chromaticity of the graph \$F(k\-1
k\-
k\-s)\$ is discussed
a sufficient condition of it being chromatically unique is obtained.And it proves a family of \$t+2 \$bridge graph \$F\-t(2
b)\$ be chromatically unique.
ChaoC Y,WhiteheadE G Jr.On chromatic equivalence of graphs,Theory andApplications ofGraphs[J].Springerverlag,1978,642:121-131.
LoerincB.ChromaticUniqueness of the generalizedθ-graph[J].DiscreteMath,1978,23:313-316.
ShaojiXu.Classes of chromatically equivalentgraphs and poygon trees[J].DiscreteMath,1994,133:267-278.
FengMingdong.OnChromaticUniqueness ofTwoInfiniteFamilies ofGraphs[J].Joural ofGraphTheory,1993,7(3):387-392.
ShojiXu,JanieLiu.eyehook pang.The chromaticity of s— aridge graphsand related graphs[J].DiscreteMath,1994,135:349-358.
鲍学文,陈祥恩.关于图θ(a,b,c,d,e)的色性[J],新疆大学学报,1994,11(3):19-22.
0
浏览量
15
下载量
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621
京公网安备11010802024621