Abstract
We obtain a result on configurations in 2-connected digraphs with no two disjoint dicycles. We derive various consequences, for example a short proof of the characterization of the minimal digraphs having no vertex meeting all dicycles and a polynomially bounded algorithm for finding a dicycle through any pair of prescribed arcs in a digraph with no two disjoint dicycles, a problem which is NP-complete for digraphs in general.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Allender, On the number of cycles possible in digraphs with large girth,Discrete Appl. Math.,10 (1985), 211–225.
J.-C. Bermond andC. Thomassen, Cycles in digraphs—a survey,J. Graph Theory,5 (1981), 1–43.
G. A. Dirac, Some results concerning the structure of graphs,Canad. Math. Bull.,6 (1963) 183–210.
Z. Ésik, On cycles of directed and undirected graphs,to appear.
S. Fortune, J. Hopcroft andJ. Wyllie, The directed subgraph homeomorphism problem,J. Theoret. Comput. Sci.,10 (1980), 111–121.
T. Gallai, Problem 6in: Theory of Graphs, Proc. Colloq. Tihany 1966, Academic Press, New York (1968), 362.
S. R. Kosaraju, On independent circuits of a digraph.J. Graph Theory,1 (1977) 379–382.
A. V. Kostochka, A problem on directed graphs (in Russian with English summary),Acta Cybernet.,6 (1983), 89–91.
L. Lovász, On graphs not containing independent circuits (in Hungarian),Mat. Lapok,16 (1965), 289–299.
C. L. Lucchesi andD. H. Younger, A minimax theorem for directed graphs,J. Lond. Math. Soc.,17 (1978), 369–374.
C. Thomassen, The 2-linkage problem for acyclic digraphs,Discrete Math.,55 (1985), 73–87.
C. Thomassen, Paths, circuits and subdivisions,in: Selected Topics in Graph Theory III (L. W. Beineke and R. J. Wilson eds.) Academic Press,to appear.