Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference29 articles.
1. Hamilton properties of graphs with large neighborhood unions;Bauer;Discrete Math.,1991
2. Graph Theory with Applications;Bondy,1976
3. Sufficient Conditions for Hamiltonicity and Traceability of K1,3-Free Graphs, Hamilton Cycles in Graphs and Related Topics;Broersma,1988
4. A reduction method to find spanning Eulerian subgraphs;Catlin;J. Graph Theory,1988
5. Graphs without spanning Eulerian trails;Catlin;Discrete Math.,1996
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献