Supported by National Natural Science Foundation of China(Grant No.11001287);Science Foundation Chongqing Education Committee(Grant Nos.KJ100725 and KJ120731)
A graphG is supereulerian if G has a spanning eulerian subgraph.Boesch et al.[J.Graph Theory,1,79–84(1977)]proposed the problem of characterizing supereulerian graphs.In this paper,we prove that any 3-edge-connecte...