Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. R. Häggkvist-C. Thomassen, Circuits through specified edges,Discrete Mathematics,41 (1982), 29–34.
2. L. Lovász, Problem 5,Period. Math. Hung.,4 (1974), 82.
3. L. Lovász,Combinatorial problems and exercises, North-Holland (1979).
4. L. Pyber, An Erdős-Gallai conjecture,Combinatorica,5 (1984), 67–80.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Connectivity;Discrete Mathematics and Its Applications;2013-11-26
2. One or Two Disjoint Circuits Cover Independent Edges;Journal of Combinatorial Theory, Series B;2002-01
3. On circuits through five edges;Discrete Mathematics;1996-11
4. Paths and cycles concerning independent edges;Graphs and Combinatorics;1990-12
5. An Improved Algorithm for Finding Cycles Through Elements;Integer Programming and Combinatorial Optimization