期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
某些有向图的几类乘积图的多数染色
1
作者 石美 夏伟皓 王纪辉 《青岛大学学报(自然科学版)》 CAS 2022年第3期4-8,共5页
将某些有向图的几类乘积图作为研究对象,对多数染色开展研究,并证明多数染色猜想对该类图是成立的。
关键词 多数染色 有向乘积 强乘积 字典乘积
下载PDF
Chromatically Equivalent Graphs with P(G, λ) = (λ- λ_1)(λ-λ_2)λ ̄(n+1)
2
作者 韩伯棠 《Journal of Beijing Institute of Technology》 EI CAS 1995年第2期122+115-122,共9页
The author finds out all of the graphs with the same chromatic polynomial and proves some relevant theorems and corollaries.
关键词 trees(mathematics) coloring (mathematics) polynomials/chromatic polynomials
下载PDF
Polyploidy Induction of Pteroceltis tatarinowii Maxim. 被引量:2
3
作者 Lin ZHANG Feng WANG +2 位作者 Zhongkui SUN Cuicui ZHU Rongwei CHEN 《Agricultural Science & Technology》 CAS 2015年第6期1159-1161,共3页
[Objective] This study was conducted to obtain tetraploid Pteroceltis tatar# nowii Maxim. with excellent ornamental traits. [Method] The stem apex growing points of Pteroceltis tatarinowii Maxim. were treated with dif... [Objective] This study was conducted to obtain tetraploid Pteroceltis tatar# nowii Maxim. with excellent ornamental traits. [Method] The stem apex growing points of Pteroceltis tatarinowii Maxim. were treated with different concentrations of colchicine solution for different hours to figure out a proper method and obtain poly- ploids. [Result] The most effective induction was obtained by treatment with 0.6%- 0.8% colchicine for 72 h with 34.2% mutation rate. Flow cytometry and chromosome observation of the stem apex growing point of P. tatarinowii Maxim. proved that the tetraploid plants were successfully obtained with chromosome number 2n=4x=36. [Conclusion] The result not only fills the blank of polyploid breeding of P. tatarinowii, but also provides an effective way to broaden the methods of cultivation of fast- growing, high-quality, disease-resilience, new varieties of Pteroceltis. 展开更多
关键词 Pteroceltis tatarinowii Maxim. TETRAPLOID COLCHICINE
下载PDF
E-Total Coloring of Complete Bipartite Graphs K_(5,n)(5≤n≤7 113)Which Are Vertex-Distinguished by Multiple Sets
4
作者 GUO Yaqin CHEN Xiang'en 《Wuhan University Journal of Natural Sciences》 CAS 2024年第5期412-418,共7页
In this study,using the method of contradiction and the pre-assignment of chromatic sets,we discuss the E-total coloring of complete bipartite graphs K_(5,n)(5≤n≤7 113) which are vertex-distinguished by multiple set... In this study,using the method of contradiction and the pre-assignment of chromatic sets,we discuss the E-total coloring of complete bipartite graphs K_(5,n)(5≤n≤7 113) which are vertex-distinguished by multiple sets.The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined. 展开更多
关键词 complete bipartite graph E-total coloring E-total chromatic number multiple sets chromatic sets
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部