Asymptotic number of edge-colored regular graphs

We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an application, we compute the expected number of proper $c$-edge-colorings of a large random $k$-regular graph.