Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. N. Alon and M. Tarsi, Covering multigraphs by simple circuits, SIAM Journal on Algebraic and Discrete Methods 6 1985, 345–350.
2. J. C. Bermond, B. Jackson and F. Jaeger, Shortest coverings of graphs with cycles, Journal of Combinatorial Theory Series B 35 1983, 297–308.
3. R. Brunet, B. Mohar and R. B. Richter, Separating and nonseparating disjoint homotopic cycles in graph embeddings, Journal of Combinatorial Theory Series B 66 (1996), 201–231.
4. G.-H. Fan and A. Raspaud, Fulkerson’s conjecture and circuit covers, Journal of Combinatorial Theory Series B 61 1994, 133–138.
5. M.-G. Guan and H. Fleischner, On the minimum weighted cycle covering problem for planar graphs, Ars Combinatoria 20 1985, 61–68.