Discrete Mathematics
边着色
Edge coloringA graph theory concept where edges of a graph are assigned colors such that no two edges sharing a common vertex have the same color. / 图论概念，指给图的边分配颜色，使得没有两条共享公共顶点的边具有相同的颜色。
- Knowledge type
- 数学理论
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-11-10 16:06:27
Sub-knowledge points
Vizing's theoremClass 1 and Class 2 graphs
Higher-order knowledge points
Graph coloringGraph theory
Main parameters and performance indicators
chromatic index: The minimum number of colors needed for a proper edge coloring
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsRich edge-colorings of subcubic graphsOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Edge coloring.
Node update feedback
review required