On the 2‐cyclic property in 2‐regular digraphs

DOI10.1002/rsa.3240060407zbMath0842.05056OpenAlexW2052286133MaRDI QIDQ4845081

Colin Cooper

Publication date: 10 December 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060407

zbMATH Keywords

cycledigraphrandom graphregular2-cyclic

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Unnamed Item

Cites Work

• The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected
• On the connectivity of random m-orientable graphs and digraphs
• The directed subgraph homeomorphism problem
• Highly connected non-2-linked digraphs
• Hamilton Cycles in Random Regular Digraphs
• Asymptotic Enumeration of Predicate-Junction Flowgraphs

This page was built for publication: On the 2‐cyclic property in 2‐regular digraphs