Graphs without spanning closed trails

Discrete Mathematics

Volumn 160, Issue 1-3, 1996, Pages 81-91

  Catlin, Paul A ^a   Han, Zheng Yiao ^b   Lai, Hong Jian ^c  

^a WAYNE STATE UNIVERSITY   (United States)

^b LIAONING NORMAL UNIVERSITY   (China)

^c WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040889681     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(95)00149-Q     Document Type: Article

References (13)

1. F.T. Boesch, C. Suffel and R. Tindell, The spanning subgraphs of eulerian graphs, J. Graph Theory 1 (1977) 79-84.
2. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (American Elsevier, New York, 1976).
3. P.A. Catlin, A reduction method to find spanning eulerian subgraphs, J. Graph Theory 12 (1988) 29-45.
4. P.A. Catlin, Nearly eulerian spanning subgraphs, Ars Combin. 25 (1988) 115-124.
5. P.A. Catlin, Spanning eulerian subgraphs and matchings, Discrete Math. 76 (1989) 95-116.
6. P.A. Catlin, Supereulerian graphs, collapsible graphs and four-cycles, Proc. 18th Southeastern Conf, Baton Rouge, Congr. Numer. 58 (1987) 233-246.
7. P.A. Catlin, Supereulerian graphs: a survey, J. Graph Theory 16 (1992) 177-196.
8. P.A. Catlin and H.-J. Lai, Spanning trails joining two given edges, in: Alavi et al., eds, Graph Theory, Combinatorics, and Applications (Wiley, New York, 1991) 207-232.
9. Z.-H. Chen, Supereulerian graphs and the Petersen graph, J. Combin. Math. Combin. Comput. 9 (1991) 79-89.
10. F. Jaeger, A note on sub-Eulerian graphs, J. Graph Theory 3 (1979) 91-93.
11. H.-J. Lai, Reduced graphs of diameter two, J. Graph Theory 14 (1990) 77-87.
12. C.St.J.A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964) 12.
13. S.M. Zhan, Hamiltonian connectedness of line graphs, Ars Combin. 22 (1986) 89-95.