Degree Constrained Orientations in Countable Graphs
Keyword(s):
Degree constrained orientations are orientations of an (undirected) graph where the in-degree function satisfies given lower and upper bounds. For finite graphs Frank and Gyárfás (1976) gave a necessary and sufficient condition for the existence of such an orientation. We extend their result to countable graphs.
2019 ◽
Vol 18
(01)
◽
pp. 1950006
◽
2017 ◽
Vol E100.A
(12)
◽
pp. 2764-2775
◽