Gallai–Hasse–Roy–Vitaver theorem

In graph theory, the Gallai–Hasse–Roy–Vitaver theorem is a form of duality between the colorings of the vertices of a given undirected graph and the orientations of its edges. It states that the minimum number of colors needed to properly color any graph G {\displaystyle G} equals one plus the length of a longest path in an orientation of G {\displaystyle G} chosen to minimize this path's length.

Source: Wikipedia — Gallai–Hasse–Roy–Vitaver theorem (CC BY-SA 4.0)

Gallai–Hasse–Roy–Vitaver theorem

In graph theory, the Gallai–Hasse–Roy–Vitaver theorem is a form of duality between the colorings of the vertices of a given undirected graph and the orientations of its edges. It states that the minimum number of colors needed to properly color any graph G {\displaystyle G} equals one plus the length of a longest path in an orientation of G {\displaystyle G} chosen to minimize this path's length.

This neuron ends here.

Source: Wikipedia "Gallai–Hasse–Roy–Vitaver theorem" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy