Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- File Type
Articles 1 - 2 of 2
Full-Text Articles in Mathematics
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Zhi-Hong Chen
No abstract provided.
Reductions Of Graphs And Spanning Eulerian Subgraphs, Zhi-Hong Chen
Reductions Of Graphs And Spanning Eulerian Subgraphs, Zhi-Hong Chen
Zhi-Hong Chen
This dissertation is primarily focused on conditions for the existence of spanning closed trails in graphs. However, results in my dissertation and the method we used, which was invented by Catlin, are not only useful for finding spanning closed trails in graphs, but also useful to study double cycle cover problems, hamiltonian line graphs problems, and dominating closed trail problems, etc. A graph is called supereulerian if it contains a spanning closed trail. Several, people have worked on the conditions for spanning closed trails having the form "d(u) + d(v) $>$ cn (0 $<$ c $<$ 1)" for all edge …