KnowraEdge coloringLinked fromLinked fromThe 15 pages that link to Edge coloring, each with the reason it gives.All 15Related 7Narrower topic 4Compared with 4Petersen graphNarrower topic: The Petersen graph’s failure of 3-edge-colorability is central to its reputation.Vizing's theoremNarrower topic: Vizing’s theorem bounds the number of colors needed for this graph-coloring problem.Goldberg–Seymour conjectureNarrower topic: The conjecture bounds the minimum number of colors needed for this assignment.List coloring conjectureNarrower topic: Its minimum color count is the ordinary parameter the conjecture compares.