Contents

-

Minimum Degree and the Orientation of a Graph

P. Katerinis1
1Athens University of Economics Department of Informatics 76 Patission Str., Athens 10434, Greece

Abstract

Let G be a simple graph such that δ(G)|V(G)|2+k, where k is a non-negative integer, and let f:V(G)Z+ be a function having the following properties (i)dG(x)2k+12f(x)dG(x)2+k+12 for every xV(G), (ii)xV(G)f(x)=|E(G)|. Then G has an orientation D such that dD+(x)=f(x), for every xV(G).