bn:03343989n
Noun Concept
ES
teorema vizing
EN
In graph theory, Vizing's theorem states that every simple undirected graph may be edge colored using a number of colors that is at most one larger than the maximum degree Δ of the graph. Wikipedia
Relations
Sources
IS A
Wikipedia Translations