Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03343989n
Noun Concept
PT
No term available
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
teorema

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License