Vizing's theorem
Description: A graph theory theorem stating that the chromatic index of a simple graph is either its maximum degree or one greater.
Primary topic: Graph Labeling and Dimension Problems (51%)
Wikidata ID: wiki/Q2226822
OpenAlex ID: keywords/vizing-s-theorem
