Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. A.Benhocine, L.Clark, N.Köhler and H. J.Veldman, On circuits and pancyclic line graphs,Preprint, 1985.
2. P. A.Catlin, Removing forests to find spanning eulerian subgraphs,Preprint, 1985.
3. P. A.Catlin, Spanning eulerian subgraphs and matchings,Preprint.
4. F. Harary andC. St. J. A. Nash-Williams, On eulerian and hamiltonian graphs and line graphs,Canadian Math. Bull 8 (1965), 701–710.
5. F. Jaeger, A note on subeulerian graphs,J. Graph Theory 3 (1979), 91–93.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献