搜索结果: 1-3 共查到“组合数学 Edge coloring”相关记录3条 . 查询时间(0.114 秒)
Acyclic edge-coloring using entropy compression
Acyclic edge-coloring entropy compression Combinatorics
2012/6/29
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-co...
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...
Edge-coloring series-parallel multigraphs
Edge-coloring series-parallel multigraphs Data Structures and Algorithms Combinatorics
2011/10/9
Abstract: We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colore...