Kolesnik, Brett The asymptotic number of score sequences. (English) Zbl 07745902 Combinatorica 43, No. 4, 827-844 (2023). MSC: 05A16 05C20 05C30 11P21 51M20 52B05 60E07 60K05 PDFBibTeX XMLCite \textit{B. Kolesnik}, Combinatorica 43, No. 4, 827--844 (2023; Zbl 07745902) Full Text: DOI arXiv
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomassé, Stéphan Coloring dense digraphs. (English) Zbl 1449.05095 Combinatorica 39, No. 5, 1021-1053 (2019). Reviewer: Peter Horák (Tacoma) MSC: 05C15 05C20 05C42 PDFBibTeX XMLCite \textit{A. Harutyunyan} et al., Combinatorica 39, No. 5, 1021--1053 (2019; Zbl 1449.05095) Full Text: DOI
Mészáros, András A note on disjoint dijoins. (English) Zbl 1424.05121 Combinatorica 38, No. 6, 1485-1488 (2018). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{A. Mészáros}, Combinatorica 38, No. 6, 1485--1488 (2018; Zbl 1424.05121) Full Text: DOI
Dobson, Edward; Spiga, Pablo; Verret, Gabriel Cayley graphs on abelian groups. (English) Zbl 1399.05100 Combinatorica 36, No. 4, 371-393 (2016). Reviewer: Wen-Fong Ke (Tainan) MSC: 05C25 20B25 20K01 PDFBibTeX XMLCite \textit{E. Dobson} et al., Combinatorica 36, No. 4, 371--393 (2016; Zbl 1399.05100) Full Text: DOI arXiv
Hoshino, Richard; Kawarabayashi, Ken-Ichi The edge density of critical digraphs. (English) Zbl 1374.05103 Combinatorica 35, No. 5, 619-631 (2015). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C35 05C40 05C15 PDFBibTeX XMLCite \textit{R. Hoshino} and \textit{K.-I. Kawarabayashi}, Combinatorica 35, No. 5, 619--631 (2015; Zbl 1374.05103) Full Text: DOI
Dunkum, Molly; Hamburger, Peter; Pór, Attila Destroying cycles in digraphs. (English) Zbl 1249.05163 Combinatorica 31, No. 1, 55-66 (2011). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C38 05C85 PDFBibTeX XMLCite \textit{M. Dunkum} et al., Combinatorica 31, No. 1, 55--66 (2011; Zbl 1249.05163) Full Text: DOI
Pegden, Wesley Distance sequences in locally infinite vertex-transitive digraphs. (English) Zbl 1121.05043 Combinatorica 26, No. 5, 577-585 (2006). MSC: 05C12 05C20 PDFBibTeX XMLCite \textit{W. Pegden}, Combinatorica 26, No. 5, 577--585 (2006; Zbl 1121.05043) Full Text: DOI
Goldberg, Andrew V.; Karzanov, Alexander V. Path problems in skew-symmetric graphs. (English) Zbl 0867.05037 Combinatorica 16, No. 3, 353-382 (1996). Reviewer: J.Bang-Jensen (Odense) MSC: 05C38 05C85 PDFBibTeX XMLCite \textit{A. V. Goldberg} and \textit{A. V. Karzanov}, Combinatorica 16, No. 3, 353--382 (1996; Zbl 0867.05037) Full Text: DOI
Seymour, P. D. Packing circuits in eulerian digraphs. (English) Zbl 0858.05051 Combinatorica 16, No. 2, 223-231 (1996). Reviewer: D.P.Brown (Carbondale) MSC: 05C20 05C70 05C38 05C45 PDFBibTeX XMLCite \textit{P. D. Seymour}, Combinatorica 16, No. 2, 223--231 (1996; Zbl 0858.05051) Full Text: DOI
Mader, W. Existence of vertices of local connectivity \(k\) in digraphs of large outdegree. (English) Zbl 0838.05075 Combinatorica 15, No. 4, 533-539 (1995). Reviewer: F.Gliviak (Bratislava) MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{W. Mader}, Combinatorica 15, No. 4, 533--539 (1995; Zbl 0838.05075) Full Text: DOI
Cheriyan, Joseph; Reif, John H. Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity. (English) Zbl 0810.05048 Combinatorica 14, No. 4, 435-451 (1994). MSC: 05C40 52A20 68W15 05C20 05C85 05C10 68R10 PDFBibTeX XMLCite \textit{J. Cheriyan} and \textit{J. H. Reif}, Combinatorica 14, No. 4, 435--451 (1994; Zbl 0810.05048) Full Text: DOI
Cameron, Peter J.; Praeger, Cheryl E.; Wormald, Nicholas C. Infinite highly arc transitive digraphs and universal covering digraphs. (English) Zbl 0793.05065 Combinatorica 13, No. 4, 377-396 (1993). Reviewer: F.Gliviak (Bratislava) MSC: 05C25 05C20 PDFBibTeX XMLCite \textit{P. J. Cameron} et al., Combinatorica 13, No. 4, 377--396 (1993; Zbl 0793.05065) Full Text: DOI
Blidia, M.; Duchet, P.; Maffray, F. On kernels in perfect graphs. (English) Zbl 0780.05020 Combinatorica 13, No. 2, 231-233 (1993). Reviewer: Liu Yanpei (Beijing) MSC: 05C15 05C20 05C75 05C70 PDFBibTeX XMLCite \textit{M. Blidia} et al., Combinatorica 13, No. 2, 231--233 (1993; Zbl 0780.05020) Full Text: DOI
Seymour, P. D. Directed circuits on a torus. (English) Zbl 0736.05044 Combinatorica 11, No. 3, 261-273 (1991). Reviewer: D.P.Brown (Carbondale) MSC: 05C20 05C38 05C10 PDFBibTeX XMLCite \textit{P. D. Seymour}, Combinatorica 11, No. 3, 261--273 (1991; Zbl 0736.05044) Full Text: DOI
King, V. A lower bound for the recognition of digraph properties. (English) Zbl 0733.05041 Combinatorica 10, No. 1, 53-59 (1990). Reviewer: Wai Kai Chen MSC: 05C20 05C35 05C50 PDFBibTeX XMLCite \textit{V. King}, Combinatorica 10, No. 1, 53--59 (1990; Zbl 0733.05041) Full Text: DOI
Bender, E. A.; Richmond, L. B.; Robinson, R. W.; Wormald, N. C. The asymptotic number of acyclic digraphs. I. (English) Zbl 0601.05025 Combinatorica 6, 15-22 (1986). Reviewer: E.M.Palmer MSC: 05C30 05C20 PDFBibTeX XMLCite \textit{E. A. Bender} et al., Combinatorica 6, 15--22 (1986; Zbl 0601.05025) Full Text: DOI
Blidia, Mostafa A parity digraph has a kernel. (English) Zbl 0599.05028 Combinatorica 6, 23-27 (1986). Reviewer: J.W.Moon MSC: 05C20 PDFBibTeX XMLCite \textit{M. Blidia}, Combinatorica 6, 23--27 (1986; Zbl 0599.05028) Full Text: DOI
Mader, W. Degree and local connectivity in digraphs. (English) Zbl 0576.05044 Combinatorica 5, 161-165 (1985). Reviewer: M.C.Heydemann MSC: 05C40 05C20 05C38 PDFBibTeX XMLCite \textit{W. Mader}, Combinatorica 5, 161--165 (1985; Zbl 0576.05044) Full Text: DOI
Gröflin, Heinz Path-closed sets. (English) Zbl 0559.05034 Combinatorica 4, 281-290 (1984). Reviewer: Ch.Schulz MSC: 05C20 05C38 90C35 PDFBibTeX XMLCite \textit{H. Gröflin}, Combinatorica 4, 281--290 (1984; Zbl 0559.05034) Full Text: DOI
Meir, A.; Moon, J. W. On random mapping patterns. (English) Zbl 0532.05033 Combinatorica 4, 61-70 (1984). Reviewer: D.Kelly MSC: 05C20 05C30 05C80 PDFBibTeX XMLCite \textit{A. Meir} and \textit{J. W. Moon}, Combinatorica 4, 61--70 (1984; Zbl 0532.05033) Full Text: DOI
Grötschel, Martin; Lovász, László; Schrijver, A. The ellipsoid method and its consequences in combinatorial optimization. (English) Zbl 0492.90056 Combinatorica 1, 169-197 (1981). MSC: 90C10 68Q25 65K05 90C05 90C09 PDFBibTeX XMLCite \textit{M. Grötschel} et al., Combinatorica 1, 169--197 (1981; Zbl 0492.90056) Full Text: DOI
Kleitman, Daniel J.; Winston, Kenneth J. Forests and score vectors. (English) Zbl 0491.05028 Combinatorica 1, 49-54 (1981). MSC: 05C20 05C05 PDFBibTeX XMLCite \textit{D. J. Kleitman} and \textit{K. J. Winston}, Combinatorica 1, 49--54 (1981; Zbl 0491.05028) Full Text: DOI Backlinks: MO
Bermond, J. C.; Germa, A.; Heydemann, M. C.; Sotteau, D. Longest paths in digraphs. (English) Zbl 0488.05039 Combinatorica 1, 337-341 (1981). MSC: 05C20 05C38 05C75 PDFBibTeX XMLCite \textit{J. C. Bermond} et al., Combinatorica 1, 337--341 (1981; Zbl 0488.05039) Full Text: DOI
Frank, Andras How to make a digraph strongly connected. (English) Zbl 0487.05033 Combinatorica 1, 145-153 (1981). MSC: 05C20 05C40 68R10 68Q25 90C10 PDFBibTeX XMLCite \textit{A. Frank}, Combinatorica 1, 145--153 (1981; Zbl 0487.05033) Full Text: DOI