References
- M. An and L. Xiong, Supereulerian graphs, collapsible graphs and matchings, Acta Mathematicae Applicatae Sinia (English Series), to appear.
- L.W. Beinike, Derived graphs and digraphs, H. Sachs, H. Voss, and H. Walther, eds., Beitrage zur Graphentheorie, Teubner, Leipzig, 1968, pp. 17–33.
- F.T. Boesch, C. Suffel, and R. Tindell, The spanning subgraphs of Eulerian graphs, J. Graph Theory 1 (1977), pp. 79–84. doi: 10.1002/jgt.3190010115
- J.A. Bondy and U.S.R. Murty, Graph Theory, Springer, New York, 2008.
- H.J. Broersma and L.M. Xiong, A note on minimum degree conditions for supereulerian graphs, Discret. Appl. Math. 120 (2002) 35–43. doi: 10.1016/S0166-218X(01)00278-5
- P.A. Catlin, Super-Eulerian graphs, collapsible graphs, and four-cycles, Congr. Numer. 58 (1987), pp. 233–246.
- P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988), pp. 29–45. doi: 10.1002/jgt.3190120105
- P.A. Catlin, Super-Eulerian graphs, a survey, J. Graph Theory 16 (1992), pp. 177–196. doi: 10.1002/jgt.3190160209
- P.A. Catlin and X.W. Li, Supereulerian graphs of minimum degree at least 4, J. Adv. Math. 28 (1999), pp. 65–69.
- P.A. Catlin, Z. Han, and H.-J. Lai, Graphs without spanning Eulerian subgraphs, Discrete Math. 160 (1996), pp. 81–91. doi: 10.1016/S0012-365X(95)00149-Q
- Z.H. Chen and H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics (a survey), Combinatorics and Graph Theory 95, Vol. 1 (Hefei), World Sci. Publishing, River Edge, NJ, 1995, pp. 53–69.
- V. Chvátal and P. Erdös, A note on Hamilton circuits, Discrete Math. 2 (1972), pp. 111–135. doi: 10.1016/0012-365X(72)90079-9
- E. Flandrin and H. Li, Further result on neighbourhood intersections, Repport de Recheche, L. R. I. No. 416, Univ. Paris-Sud, Orsay, 1989.
- F. Harary, Graph Theory, Addison-Wesley Publishing, Reading, MA, 1969.
- F. Harary and C.St.J.A. Nash-Williams, On Eulerian and Hamiltonian graphs and line graphs, Canad. Math. Bull. 8 (1965), pp. 701–709. doi: 10.4153/CMB-1965-051-3
- H.-J. Lai and Y. T. Liang, Supereulerian graphs in the graph family C2(6, k), Discret. Appl. Math. 159 (2011), pp. 467–477. doi: 10.1016/j.dam.2010.12.005
- H.-J. Lai and H. Y. Yan, Supereulerian graphs and matchings, Appl. Math. Letters 24 (2011), pp. 1867–1869. doi: 10.1016/j.aml.2011.05.008
- X.M. Li, D.X. Li, and H.-J. Lai, The Supereulerian graphs in the graph family C(l, k), Discrete Math. 309 (2009), pp. 2937–2942. doi: 10.1016/j.disc.2008.06.038
- W.R. Pulleyblank, A note on graphs spanned by Eulerian graphs, J. Graph Theory 3 (1979), pp. 309–310. doi: 10.1002/jgt.3190030316
- Z. Ryjácbreveek, On a closure concept in claw-free graphs, J. Combin. Theory Ser. B 70 (1997), pp. 217–224. doi: 10.1006/jctb.1996.1732
- Y. Shao, Claw-free graphs and line graphs, Ph.D. diss., West Virginia University, 2005.