Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Vizing's_theorem> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Vizing's_theorem abstract "In graph theory, Vizing's theorem (named for Vadim G. Vizing who published it in 1964) states that the edges of every undirected graph may be colored using a number of colors that is at most one larger than the maximum degree Δ of the graph.At least Δ colors are always necessary, so the undirected graphs may be partitioned into two classes: "class one" graphs for which Δ colors suffice, and "class two" graphs for which Δ + 1 colors are necessary.".
- Vizing's_theorem wikiPageExternalLink ?op=getobj&from=objects&id=6932.
- Vizing's_theorem wikiPageExternalLink newsletter38.pdf.
- Vizing's_theorem wikiPageExternalLink 1977-20.pdf.
- Vizing's_theorem wikiPageID "5449464".
- Vizing's_theorem wikiPageRevisionID "539351145".
- Vizing's_theorem hasPhotoCollection Vizing's_theorem.
- Vizing's_theorem subject Category:Graph_coloring.
- Vizing's_theorem subject Category:Theorems_in_graph_theory.
- Vizing's_theorem comment "In graph theory, Vizing's theorem (named for Vadim G. Vizing who published it in 1964) states that the edges of every undirected graph may be colored using a number of colors that is at most one larger than the maximum degree Δ of the graph.At least Δ colors are always necessary, so the undirected graphs may be partitioned into two classes: "class one" graphs for which Δ colors suffice, and "class two" graphs for which Δ + 1 colors are necessary.".
- Vizing's_theorem label "Satz von Vizing".
- Vizing's_theorem label "Théorème de Vizing".
- Vizing's_theorem label "Vizing's theorem".
- Vizing's_theorem label "Vizing定理".
- Vizing's_theorem label "Теорема Визинга".
- Vizing's_theorem sameAs Satz_von_Vizing.
- Vizing's_theorem sameAs Théorème_de_Vizing.
- Vizing's_theorem sameAs m.0kvgt5t.
- Vizing's_theorem sameAs Q2226822.
- Vizing's_theorem sameAs Q2226822.
- Vizing's_theorem wasDerivedFrom Vizing's_theorem?oldid=539351145.
- Vizing's_theorem isPrimaryTopicOf Vizing's_theorem.