In this note, we verify two conjectures of Catlin in [J. Graph Theory 13 (1989) 465 - 483] for graphs with at most 11 vertices. These are used to prove the following theorem which improves prior results in  and :
Let G be a 3-edge-connected simple graph with order n. If n is large and if for every edge 11.v E E(G), d(u) + d(v) 2 % - 2, then either G has a spanning eulerian subgraph or G can be contracted to the Petersen graph.
This article was originally published in Ars Combinatoria, 1998, Volume 48.
Chen, Zhi-Hong and Lai, Hong-Jian, "Supereulerian graphs and the Petersen graph, II" Ars Combinatoria / (1995): 271-282.
Available at https://digitalcommons.butler.edu/facsch_papers/1053