Covering weighted graphs by even subgraphs
Main result: Every bridgeless graph G with weighted edges has an edge cover by four subgraphs with even vertex-degrees such that every edge is contained exactly in two, or exactly in four of them and the total weight of them is at most 20/9 of the weight of G. Several corollaries for unweighted graphs are given.
scientific article; zbMATH DE number 4181396