We deal with finite graphs which admit a labeling of edges by pairwise different positive integers from the set \(\{1, 2, \ldots, |E(G)|\}\) in such a way that the sum of the labels of the edges incident to a particular vertex is the same for all vertices. We construct edge labelings for two families of quartic graphs, i.e., regular graphs of degree \(d = 4\).