Coulson, Matthew The critical window in random digraphs. (English) Zbl 1510.05260 Comb. Probab. Comput. 31, No. 3, 411-429 (2022). MSC: 05C80 05C20 05D40 PDFBibTeX XMLCite \textit{M. Coulson}, Comb. Probab. Comput. 31, No. 3, 411--429 (2022; Zbl 1510.05260) Full Text: DOI arXiv
Kang, Dong Yeap Sparse highly connected spanning subgraphs in dense directed graphs. (English) Zbl 1473.05109 Comb. Probab. Comput. 28, No. 3, 423-464 (2019). Reviewer: Akira Saito (Tokyo) MSC: 05C20 05C42 05C40 PDFBibTeX XMLCite \textit{D. Y. Kang}, Comb. Probab. Comput. 28, No. 3, 423--464 (2019; Zbl 1473.05109) Full Text: DOI arXiv
Hamidoune, Yahya Ould On iterated image size for point-symmetric relations. (English) Zbl 1154.05037 Comb. Probab. Comput. 17, No. 1, 61-66 (2008). Reviewer: Robert Jajcay (Terre Haute) MSC: 05C25 05C20 20B25 PDFBibTeX XMLCite \textit{Y. O. Hamidoune}, Comb. Probab. Comput. 17, No. 1, 61--66 (2008; Zbl 1154.05037) Full Text: DOI arXiv
Cooper, Colin; Frieze, Alan The size of the largest strongly connected component of a random digraph with a given degree sequence. (English) Zbl 1065.05085 Comb. Probab. Comput. 13, No. 3, 319-337 (2004). Reviewer: Sergej L. Bezrukov (Superior) MSC: 05C80 05C07 PDFBibTeX XMLCite \textit{C. Cooper} and \textit{A. Frieze}, Comb. Probab. Comput. 13, No. 3, 319--337 (2004; Zbl 1065.05085) Full Text: DOI
Balister, Paul Packing digraphs with directed closed trails. (English) Zbl 1015.05072 Comb. Probab. Comput. 12, No. 1, 1-15 (2003). Reviewer: Zbigniew Lonc (Warszawa) MSC: 05C70 05C20 05C45 PDFBibTeX XMLCite \textit{P. Balister}, Comb. Probab. Comput. 12, No. 1, 1--15 (2003; Zbl 1015.05072) Full Text: DOI
Bang-Jensen, Jørgen; Jordán, Tibor Adding and reversing arcs in semicomplete digraphs. (English) Zbl 0892.05019 Comb. Probab. Comput. 7, No. 1, 17-25 (1998). Reviewer: D.P.Brown (Carbondale) MSC: 05C20 05C40 05C35 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{T. Jordán}, Comb. Probab. Comput. 7, No. 1, 17--25 (1998; Zbl 0892.05019) Full Text: DOI
Thorup, Mikkel Shortcutting planar digraphs. (English) Zbl 0839.05044 Comb. Probab. Comput. 4, No. 3, 287-315 (1995). Reviewer: M.Loebl (Waterloo/Ontario) MSC: 05C20 05C05 68R10 05C10 05C12 PDFBibTeX XMLCite \textit{M. Thorup}, Comb. Probab. Comput. 4, No. 3, 287--315 (1995; Zbl 0839.05044) Full Text: DOI
Cooper, Colin; Frieze, Alan; Molloy, Michael Hamilton cycles in random regular digraphs. (English) Zbl 0809.05081 Comb. Probab. Comput. 3, No. 1, 39-49 (1994). Reviewer: O.Frank (Stockholm) MSC: 05C80 05C45 05C20 PDFBibTeX XMLCite \textit{C. Cooper} et al., Comb. Probab. Comput. 3, No. 1, 39--49 (1994; Zbl 0809.05081) Full Text: DOI
Mader, W. On vertex-edge-critically \(n\)-connected graphs. (English) Zbl 0807.05046 Comb. Probab. Comput. 3, No. 2, 257-271 (1994). Reviewer: W.K.Chen (Chicago) MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{W. Mader}, Comb. Probab. Comput. 3, No. 2, 257--271 (1994; Zbl 0807.05046) Full Text: DOI
Reed, B.; McDiarmid, Colin The strongly connected components of 1-in, 1-out. (English) Zbl 0793.05112 Comb. Probab. Comput. 1, No. 3, 265-274 (1992). MSC: 05C80 60C05 PDFBibTeX XMLCite \textit{B. Reed} and \textit{C. McDiarmid}, Comb. Probab. Comput. 1, No. 3, 265--274 (1992; Zbl 0793.05112) Full Text: DOI