搜索结果: 1-1 共查到“代数学 Rainbow connection”相关记录1条 . 查询时间(0.804 秒)
A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rainbow connected if th...