排序方式: 共有3条查询结果,搜索用时 15 毫秒
1
1.
2.
For given graphs G and H and an integer k, the Gallai–Ramsey number is defined to be the minimum integer n such that, in any k coloring of the edges of Kn, there exists a subgraph isomorphic to either a rainbow coloring of G or a monochromatic coloring of H. In this work, we consider Gallai–Ramsey numbers for the case when G=K3 and H is a cycle of a fixed length. 相似文献
3.
1