Frank, András Increasing the rooted connectivity of a digraph by one. (English) Zbl 0930.05074 Math. Program. 84, No. 3 (B), 565-576 (1999). Reviewer: M.Harminc (Košice) MSC: 05C70 90C27 PDFBibTeX XMLCite \textit{A. Frank}, Math. Program. 84, No. 3 (B), 565--576 (1999; Zbl 0930.05074) Full Text: DOI
Frank, András; Jordán, Tibor Directed vertex-connectivity augmentation. (English) Zbl 0934.05081 Math. Program. 84, No. 3 (B), 537-553 (1999). Reviewer: F.Gliviak (Bratislava) MSC: 05C40 05C20 05C85 90C27 PDFBibTeX XMLCite \textit{A. Frank} and \textit{T. Jordán}, Math. Program. 84, No. 3 (B), 537--553 (1999; Zbl 0934.05081) Full Text: DOI
Frank, András; Jordán, Tibor Minimal edge-coverings of pairs of sets. (English) Zbl 0830.05051 J. Comb. Theory, Ser. B 65, No. 1, 73-110 (1995). Reviewer: J.W.Moon (Edmonton) MSC: 05C70 05B35 05C40 05C35 05C20 68Q25 68R10 05C38 PDFBibTeX XMLCite \textit{A. Frank} and \textit{T. Jordán}, J. Comb. Theory, Ser. B 65, No. 1, 73--110 (1995; Zbl 0830.05051) Full Text: DOI Link
Frank, András Submodular functions in graph theory. (English) Zbl 0788.05078 Discrete Math. 111, No. 1-3, 231-243 (1993). MSC: 05C75 05C20 05C99 PDFBibTeX XMLCite \textit{A. Frank}, Discrete Math. 111, No. 1--3, 231--243 (1993; Zbl 0788.05078) Full Text: DOI
Frank, A. On connectivity properties of Eulerian digraphs. (English) Zbl 0674.05045 Graph theory in memory of G. A. Dirac, Pap. Meet., Sandbjerg/Den. 1985, Ann. Discrete Math. 41, 179-194 (1989). Reviewer: P.Horák MSC: 05C40 05C20 05C45 PDFBibTeX XML
Frank, A.; Tardos, É. Matroids from crossing families. (English) Zbl 0571.05011 Finite and infinite sets, 6th Hung. Combin. Colloq., Eger/Hung. 1981, Vol. I, Colloq. Math. Soc. János Bolyai 37, 295-304 (1984). Reviewer: A.Recski MSC: 05B35 PDFBibTeX XML
Frank, Andras An algorithm for submodular functions on graphs. (English) Zbl 0504.05059 Ann. Discrete Math. 16, 97-120 (1982). MSC: 05C99 68W99 90C10 05B35 05C20 PDFBibTeX XMLCite \textit{A. Frank}, Ann. Discrete Math. 16, 97--120 (1982; Zbl 0504.05059) 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
Frank, Andras On the orientation of graphs. (English) Zbl 0443.05045 J. Comb. Theory, Ser. B 28, 251-261 (1980). MSC: 05C20 05C99 05C40 PDFBibTeX XMLCite \textit{A. Frank}, J. Comb. Theory, Ser. B 28, 251--261 (1980; Zbl 0443.05045) Full Text: DOI
Frank, Andras Kernel systems of directed graphs. (English) Zbl 0425.05028 Acta Sci. Math. 41, 63-76 (1979). MSC: 05C20 05B40 PDFBibTeX XMLCite \textit{A. Frank}, Acta Sci. Math. 41, 63--76 (1979; Zbl 0425.05028)