Publisher
Springer International Publishing
Reference44 articles.
1. N. Alon, C. McDiarmid, and M. Molloy. Edge-disjoint cycles in regular directed graphs. J. Graph Theory, 22(3):231–237, 1996.
2. J. Bang-Jensen and G. Gutin. Digraphs: Theory, Algorithms and Applications. Springer-Verlag, London, 2nd edition, 2009.
3. H.L. Bodlaender, S. Thomassé, and A. Yeo. Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci., 412(35):4570–4578, 2011.
4. R.A. Brualdi and J. Shen. Disjoint cycles in eulerian digraphs and the diameter of interchange graphs. J. Combin. Theory Ser. B, 85(2):189–196, 2002.
5. J. Chen, Y. Liu, S. Lu, B. O’Sullivan, and I. Razgon. Directed Feedback Vertex Set is Fixed-Parameter Tractable. In STOC 2008: 40th Annual ACM Symposium on Theory of Computing. ACM Press, 2008.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献