Skip to search formSkip to main contentSkip to account menu

Gallai–Hasse–Roy–Vitaver theorem

Known as: 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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Acyclic orientationDirected acyclic graphDirected graphGraph homomorphism

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Component Games on Regular Graphs
  • Rani HodA. Naor
  • Combinatorics, probability & computing
  • 2013
  • Corpus ID: 7930432
We study the (1:b) Maker–Breaker component game, played on the edge set of a d-regular graph. Maker's aim in this game is to… 
1992
1992
Contributions to the theory of graphic sequences
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)