|
|||||
|
|
Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs |
|
| Institution: | Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, China |
| Abstract: | |
| Keywords: | Edge-colored (complete) graph (Minimum) color-degree (Maximum) monochromatic-degree Properly colored cycle (path) |
| 本文献已被 ScienceDirect 等数据库收录！ | |