1. On cycles containing eight vertices and an edge in 3-connected cubic graphs;Bau;Ars Combin.,1988
2. Cycles containing 12 vertices in 3-connected cubic graphs;Bau;J. Graph Theory,1991
3. Graph Theory, Graduate in Mathematics, Vol. 244;Bondy,2008
4. A reduction method to find spanning Eulerian subgraph;Catlin;J. Graph Theory,1988
5. Supereulerian graphs, collapsible graphs, and four-cycles;Catlin;Congr. Numer.,1988