Perhaps an even more natural extension is to consider the type of facets a given d-simensional polytope have. You can ask for a simple 4 polytope (a 4-polytope whose graph is 4-regular) what are the number of facets $p_Q$ isomorphic to a given 3-polytope Q. This gives you a vector indexed by combinatorial types of simple 3-polytopes, but I am not aware of any Eberhard type theorem and I do not know even which 3-polytopes should be considered as the analogs of the hexagons in the above formula. Dually stated and extented to triangulations of 3-spheres the question is to associate to a triangulated 3-simensional sphere (or just simplicial 3-polytope) the list of links of vertices (with multiplicities) it has. A related MO question is this one.