Already for $d=3$ the boundary complex of the cyclic polytope with n vertices has a *complete graph* and hence requires $n$ colors. 

You may ask if restricting the class of triangulations can lead to interesting extension of the FCT. Some answers in http://mathoverflow.net/questions/189097/generalizations-of-the-four-color-theorem are relevant.