Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
simple graphs
|
| gptkbp:category |
theorems in graph theory
|
| gptkbp:chromaticIndexBound |
Δ(G) ≤ χ'(G) ≤ Δ(G)+1
|
| gptkbp:concerns |
edge coloring
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Vizing's theorem
|
| gptkbp:influenced |
classification of graphs by edge chromatic number
|
| gptkbp:namedAfter |
Vadim G. Vizing
|
| gptkbp:relatedTo |
gptkb:Shannon's_theorem
König's line coloring theorem |
| gptkbp:state |
The chromatic index of a simple graph is either its maximum degree or its maximum degree plus one.
|
| gptkbp:yearProposed |
1964
|
| gptkbp:bfsParent |
gptkb:Graph_coloring_problem
|
| gptkbp:bfsLayer |
6
|