On the problem of finding disjoint cycles and dicycles in a digraph-Reference-Cited by-同舟云学术

On the problem of finding disjoint cycles and dicycles in a digraph

Published:2011-12 Issue:6 Volume:31 Page:639-668
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Bang-Jensen Jørgen,Kriesell Matthias

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-011-2670-z.pdf

Reference10 articles.

1. J. Bang-Jensen and G. Gutin: Digraphs. Theory, algorithms and applications, Second edition, Springer Monographs in Mathematics, Springer-Verlag London, Ltd., London (2009).

2. J. Bang-Jensen and M. Kriesell: Disjoint directed and undirected paths and cycles in digraphs, Theoret. Comput. Sci. 46–49 (2009), 5138–5144.

3. G. A. Dirac: Some results concerning the structure of graphs, Canad. Math. Bull. 6 (1963), 183–210.

4. S. Fortune, J. Hopcroft and J. Wyllie: The directed subgraph homeomorphism problem, Theoret. Comput. Sci. 10 (1980), 111–121.

5. L. Lovász: On graphs not containing independent circuits (in Hungarian), Mat. Lapok 16 (1965), 289–299.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A note on the satisfactory partition problem: Constant size requirement;Information Processing Letters;2023-01

2. On the Number of Vertex-Disjoint Cycles in Digraphs;SIAM Journal on Discrete Mathematics;2019-01

3. Finding good 2-partitions of digraphs II. Enumerable properties;Theoretical Computer Science;2016-08

4. Arc-Disjoint Directed and Undirected Cycles in Digraphs;Journal of Graph Theory;2015-12-17

5. Restricted cycle factors and arc-decompositions of digraphs;Discrete Applied Mathematics;2015-10