搜索结果: 1-1 共查到“数学 sparse graphs”相关记录1条 . 查询时间(0.093 秒)
A proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\chi'_a(G)$, is the least number of colors $k$ such tha...
