Supereulerian graphs and the Petersen graph, II

Ars Combinatoria

Volumn 48, Issue , 1998, Pages 271-282

  Chen, Zhi Hong ^a   Lai, Hong Jian ^b  

^a BUTLER UNIVERSITY   (United States)

^b WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040635064     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Benhocine, L. Clark, N. Köhler, and H. J. Veldman, On circuits and pancyclic line graphs. J. Graph Theory 10 (1986) 411-425.
2. C. Berge, Sur le couplage maximum d'un graphe. C. R. Acad. Sci. Paris 247 (1958) 258-259.
3. J. A. Bondy and U. S. R. Murty, "Graph Theory with Applications". American Elsevier (1976).
4. P. A. Catlin, Supereulerian graphs: a survey. J. of Graph Theory 16 (1992) 177-196.
5. P. A. Catlin, A reduction method to find spanning eulerian subgraphs. J. Graph Theory 12 (1988) 29-45.
6. P. A. Catlin, Supereulerian graph, Collapsible graphs and 4-cycles. Congressus Numerantium 56 (1987) 223-246.
7. P. A. Catlin, Double cycle covers and the Petersen graph, J. Graph Theory 13 (1989) 465-483.
8. Z.-H. Chen, Supereulerian graphs and the Petersen graph. J. of Comb. Math. and Comb. Computing 9 (1991) 70-89.
9. Z.-H. Chen, Reductions of Graphs and Spanning Eulerian Subgraphs. Ph. D. Dissertation, Wayne State University, (1991).
10. Z.-H. Chen and H.-J. Lai, Collapsible graphs and matchings. J. Graph Theory 17 (1993) 597-605.
11. H.-J. Lai, Contractions and Eulerian Subgraphs, Ph. D. Dissertation, Wayne State University (1988).
12. W. T. Tutte, The factorization of linear graphs, J. London Math. Soc. 22 (1947) 107-111.
13. H.-J. Veldman, On dominating and spanning circuits in graphs, Discrete Math., accepted.
14. J. J. Watkins and R. J. Wilson, A survey of snarks, in "Graph Theory, Combinatorics, and Applications" (vol. 2), eds. by Y. Alavi, G. Chartrand, O. Oellermann and A. Schwenk, John Wiley and Sons, Kalamazoo (1992), 1129-1144.