Gallai–Hasse–Roy–Vitaver theorem
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Gallai–Hasse–Roy–Vitaver theorem
|
| gptkbp:namedAfter |
gptkb:Helmut_Hasse
gptkb:Tibor_Gallai B. Roy L. Vitaver |
| gptkbp:relatedTo |
chromatic number
directed graphs vertex coloring |
| gptkbp:state |
The chromatic number of an undirected graph equals one plus the length of the longest path in an orientation with no directed cycles.
|
| gptkbp:bfsParent |
gptkb:Tibor_Gallai
|
| gptkbp:bfsLayer |
6
|