KnowraVizing's theoremLinked fromLinked fromThe 5 pages that link to Vizing's theorem, each with the reason it gives.All 5Related 3Compared with 2Edge coloringRelated: It tightly bounds the number of colors needed for any simple graph.Brooks' theoremCompared with: It is a parallel degree bound for edge coloring rather than vertex coloring.Dinitz theoremCompared with: It bounds ordinary edge coloring, while the Dinitz result guarantees coloring from arbitrary lists.Goldberg–Seymour conjectureRelated: Its degree-based result for simple graphs forms part of the conjecture’s historical backdrop.List coloring conjectureRelated: It sharply bounds the ordinary parameter for simple graphs.