Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
Behzad–Vizing conjecture
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Total coloring conjecture
|
| gptkbp:proposedBy |
gptkb:Mehdi_Behzad
V. G. Vizing |
| gptkbp:relatedTo |
edge coloring
vertex coloring chromatic index |
| gptkbp:sentence |
The total chromatic number of any simple graph is at most Δ+2, where Δ is the maximum degree of the graph.
|
| gptkbp:status |
open problem
|
| gptkbp:yearProposed |
1965
|
| gptkbp:bfsParent |
gptkb:Graph_coloring_problem
|
| gptkbp:bfsLayer |
6
|