Skip to search form
Skip to main content
Skip to account menu
>
Semantic Scholar
Semantic Scholar's Logo
Search
Sign In
Create Free Account
You are currently offline. Some features of the site may not work correctly.
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
9 relations
Acyclic orientation
Directed acyclic graph
Directed graph
Graph homomorphism
Expand
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 Hod
,
A. Naor
Combinatorics, Probability and 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…
Expand
1992
1992
Contributions to the theory of graphic sequences
I. Zverovich
,
V. Zverovich
Discret. Math.
1992
Corpus ID: 17229170
Abstract In this article we present a new version of the Erdos-Gallai theorem concerning graphicness of the degree sequences. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE