Zhang, Cunquan The longest paths and cycles in bipartite oriented graphs. (Chinese. English summary) Zbl 0593.05044 J. Math. Res. Expo. 1981, Initial Issue, 35-38 (1981). Reviewer: Wai-Kai Chen MSC: 05C38 05C20 05C45 PDFBibTeX XML
Grötschel, Martin; Lovász, László; Schrijver, A. The ellipsoid method and its consequences in combinatorial optimization. (English) Zbl 0539.90078 IIASA Collab. Proc. Ser. CP-81-S1, 511-546 (1981). MSC: 90C10 68Q25 05C70 05B40 05B35 PDFBibTeX XML
Rastrigin, L. A. The random search in problems of the decomposition of graphs. (Russian) Zbl 0539.05059 Probl. Sluchajnogo Poiska 9, 192-227 (1981). Reviewer: J.Plesník MSC: 05C99 05C20 90C35 PDFBibTeX XMLCite \textit{L. A. Rastrigin}, Probl. Sluchaĭnogo Poiska 9, 192--227 (1981; Zbl 0539.05059)
Hahn, Stefan; Zamfirescu, Tudor Bihomogeneously traceable oriented graphs. (English) Zbl 0518.05036 Rend. Sem. Mat., Torino 39, No. 2, 137-145 (1981). MSC: 05C20 05C38 05C45 PDFBibTeX XMLCite \textit{S. Hahn} and \textit{T. Zamfirescu}, Rend. Semin. Mat., Torino 39, No. 2, 137--145 (1981; Zbl 0518.05036)
Fridman, G. Sh. Effective unsolvability of a discrete extremal problem. (Russian) Zbl 0514.05035 Methods of multidimensional economic information analysis, Work Collect., Novosibirsk 1981, 49-53 (1981). MSC: 05C35 05C20 PDFBibTeX XML
Kolodziej, Reinhold On cyclically regular directed graphs. I. (English) Zbl 0509.05045 Discuss. Math. 4, 105-107 (1981). MSC: 05C20 PDFBibTeX XMLCite \textit{R. Kolodziej}, Discuss. Math. 4, 105--107 (1981; Zbl 0509.05045)
Gansner, Emden R. Acyclic digraphs, young tableaux and nilpotent matrices. (English) Zbl 0498.05038 SIAM J. Algebraic Discrete Methods 2, 429-440 (1981). MSC: 05C20 05C50 05A17 PDFBibTeX XMLCite \textit{E. R. Gansner}, SIAM J. Algebraic Discrete Methods 2, 429--440 (1981; Zbl 0498.05038) Full Text: DOI
Fraenkel, Aviezri S. Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete. (English) Zbl 0493.68040 Discrete Appl. Math. 3, 257-262 (1981). MSC: 68Q25 05C20 68R10 PDFBibTeX XMLCite \textit{A. S. Fraenkel}, Discrete Appl. Math. 3, 257--262 (1981; Zbl 0493.68040) 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
Lozovanu, D. D. Optimal subgraphs in a weighted digraph. (English. Russian original) Zbl 0488.90067 Cybernetics 17, 172-176 (1981); translation from Kibernetika 1981, No. 2, 16-19 (1981). MSC: 90C35 05C35 90B10 05C20 94C15 PDFBibTeX XMLCite \textit{D. D. Lozovanu}, Cybernetics 17, 172--176 (1981; Zbl 0488.90067); translation from Kibernetika 1981, No. 2, 16--19 (1981) Full Text: DOI
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
Entringer, R. C.; Jackson, D. E.; Swart, Henda Detours in digraphs. (English) Zbl 0487.05032 Combinatorics, graph theory and computing, Proc. 12th Southeast. Conf., Baton Rouge 1981, Congr. Numerantium 32, 305-321 (1981). MSC: 05C20 05C40 PDFBibTeX XML
Das, Prabir Characterization of potentially self-complementary, self-converse degree- pair sequences for digraphs. (English) Zbl 0482.05038 Combinatorics and graph theory, Proc. Symp., Calcutta 1980, Lect. Notes Math. 885, 212-226 (1981). MSC: 05C20 PDFBibTeX XML
Gusev, L. A.; Petrov, S. V.; Smirnova, I. M.; Tenenbaum, L. A. Graph substitution operations and the dynamics of collateralhierarchical graphs. II. (English. Russian original) Zbl 0478.90039 Autom. Remote Control 42, 357-363 (1981); translation from Avtom. Telemekh. 1981, No. 3, 104-111 (1981). MSC: 90B99 05C38 93A13 05C35 05C20 PDFBibTeX XMLCite \textit{L. A. Gusev} et al., Autom. Remote Control 42, 357--363 (1981; Zbl 0478.90039); translation from Avtom. Telemekh. 1981, No. 3, 104--111 (1981)
Enomoto, Masatoshi; Fujii, Masatoshi; Watatani, Yasuo \(K_ 0-\)groups and classifications of Cuntz-Krieger algebras. (English) Zbl 0476.46049 Math. Jap. 26, 443-460 (1981). MSC: 46L05 46L55 46L40 54H20 PDFBibTeX XMLCite \textit{M. Enomoto} et al., Math. Japon. 26, 443--460 (1981; Zbl 0476.46049)
Hamidoune, Yahya Ould Quelques problèmes de connexite dans les graphes orientes. (French) Zbl 0475.05039 J. Comb. Theory, Ser. B 30, 1-10 (1981). MSC: 05C20 05C40 05C25 PDFBibTeX XMLCite \textit{Y. O. Hamidoune}, J. Comb. Theory, Ser. B 30, 1--10 (1981; Zbl 0475.05039) Full Text: DOI Backlinks: MO
Ciobataru, Sorin The enumeration of Hamilton roads and circuits in \({\mathcal K}^ *_ n\) and \({\mathcal K}^ *_ {n,n}\) containing or avoiding some given arcs. (Romanian) Zbl 0475.05038 Stud. Cercet. Mat. 33, 425-438 (1981). MSC: 05C20 05C45 05C30 PDFBibTeX XMLCite \textit{S. Ciobataru}, Stud. Cercet. Mat. 33, 425--438 (1981; Zbl 0475.05038)
Burns, R. N.; Steiner, G. Single machine scheduling with series-parallel precedence constraints. (English) Zbl 0474.90048 Oper. Res. 29, 1195-1207 (1981). MSC: 90B35 90C35 05C35 65K05 90C39 PDFBibTeX XMLCite \textit{R. N. Burns} and \textit{G. Steiner}, Oper. Res. 29, 1195--1207 (1981; Zbl 0474.90048) Full Text: DOI
Ramachandran, S. On a new digraph reconstruction conjecture. (English) Zbl 0474.05053 J. Comb. Theory, Ser. B 31, 143-149 (1981). MSC: 05C60 05C20 PDFBibTeX XMLCite \textit{S. Ramachandran}, J. Comb. Theory, Ser. B 31, 143--149 (1981; Zbl 0474.05053) Full Text: DOI
Esser, Friedrich; Harary, Frank The pairing theorem for digraph spectra. (English) Zbl 0474.05034 Bull. Malays. Math. Soc., II. Ser. 4, 17-19 (1981). MSC: 05C20 05C50 92Exx PDFBibTeX XMLCite \textit{F. Esser} and \textit{F. Harary}, Bull. Malays. Math. Soc., II. Ser. 4, 17--19 (1981; Zbl 0474.05034)
Perl, Juergen Graphentheorie. Grundlagen und Anwendungen. (German) Zbl 0473.68062 Studien-Texte: Informatik. Wiesbaden: Akademische Verlagsgesellschaft. 220 S. DM 56.00 (1981). MSC: 68R10 68Q25 05-04 68-01 05-01 PDFBibTeX XML
Wang, Jian-ming On the incompletely orthogonal Latin squares. (English) Zbl 0473.05012 Acta Math. Appl. Sin. 4, 381-386 (1981). MSC: 05B15 PDFBibTeX XMLCite \textit{J.-m. Wang}, Acta Math. Appl. Sin. 4, 381--386 (1981; Zbl 0473.05012)
Evans, F. J.; Schizas, C. The structural aspects of pole assignment. (English) Zbl 0468.93047 Int. J. Control 34, 991-1015 (1981). MSC: 93C35 93A15 05C20 93D15 PDFBibTeX XMLCite \textit{F. J. Evans} and \textit{C. Schizas}, Int. J. Control 34, 991--1015 (1981; Zbl 0468.93047) Full Text: DOI
Grötschel, Martin; Wakabayashi, Yoshiko On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets. (English) Zbl 0467.90046 Math. Program. Study 14, 77-97 (1981). MSC: 90C10 52Bxx 05C35 05C20 05C45 PDFBibTeX XMLCite \textit{M. Grötschel} and \textit{Y. Wakabayashi}, Math. Program. Study 14, 77--97 (1981; Zbl 0467.90046) Full Text: DOI
Syslo, Maciej M. Optimal constructions of event-node networks. (English) Zbl 0464.90078 RAIRO, Rech. Opér. 15, 241-260 (1981). MSC: 90C35 68R10 05C35 68Q25 05C20 PDFBibTeX XMLCite \textit{M. M. Syslo}, RAIRO, Rech. Opér. 15, 241--260 (1981; Zbl 0464.90078) Full Text: DOI EuDML
Bevis, Jean H.; Hall, Frank J.; Katz, Irving J. Integer generalized inverses of incidence matrices. (English) Zbl 0463.15009 Linear Algebra Appl. 39, 247-258 (1981). MSC: 15A09 15A21 05B20 15B33 05C50 PDFBibTeX XMLCite \textit{J. H. Bevis} et al., Linear Algebra Appl. 39, 247--258 (1981; Zbl 0463.15009) Full Text: DOI
Dalimaev, A. P. A decomposition approach to the analysis of the structure of multicolored-branch digraphs. (Russian) Zbl 0463.05047 Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk 1981, No. 1, 29-38 (1981). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{A. P. Dalimaev}, Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk 1981, No. 1, 29--38 (1981; Zbl 0463.05047)
Malyshko, V. V.; Yanchenko, S. S. Algorithm for the optimal reconstruction of a digraph. (English. Russian original) Zbl 0462.68045 Cybernetics 17, 63-66 (1981); translation from Kibernetika 1981, No. 1, 60-62 (1981). MSC: 68R10 05C20 94C15 PDFBibTeX XMLCite \textit{V. V. Malyshko} and \textit{S. S. Yanchenko}, Cybernetics 17, 63--66 (1981; Zbl 0462.68045); translation from Kibernetika 1981, No. 1, 60--62 (1981) Full Text: DOI
Barthelemy, Jean-Pierre About the shortest chain between two vertices in a quasi strongly connected digraph with a potential. (English) Zbl 0461.05034 Discrete Math. 34, 321-324 (1981). MSC: 05C20 06A06 05C38 05C35 PDFBibTeX XMLCite \textit{J.-P. Barthelemy}, Discrete Math. 34, 321--324 (1981; Zbl 0461.05034) Full Text: DOI
Flanigan, J. A. Selective sums of loopy partizan graph games. (English) Zbl 0458.90100 Int. J. Game Theory 10, 1-10 (1981). MSC: 91A24 05C20 91A05 PDFBibTeX XMLCite \textit{J. A. Flanigan}, Int. J. Game Theory 10, 1--10 (1981; Zbl 0458.90100) Full Text: DOI
Marcus, Daniel A. Spanning subgraphs of k-connected digraphs. (English) Zbl 0457.05035 J. Comb. Theory, Ser. B 30, 21-31 (1981). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{D. A. Marcus}, J. Comb. Theory, Ser. B 30, 21--31 (1981; Zbl 0457.05035) Full Text: DOI
Chwa, Kyung-Yong; Hakimi, S. Louis On fault identification in diagnosable systems. (English) Zbl 0456.94032 IEEE Trans. Comput. 30, 414-422 (1981). MSC: 94C15 PDFBibTeX XMLCite \textit{K.-Y. Chwa} and \textit{S. L. Hakimi}, IEEE Trans. Comput. 30, 414--422 (1981; Zbl 0456.94032) Full Text: DOI
Gattinger, M.; Wenzel, G. Verallgemeinerte Gerüste, Kozyklen und Zyklen in Graphen. (German) Zbl 0456.05034 Methods Oper. Res. 40, 321-323 (1981). MSC: 05C20 05C38 05C10 05B35 05C50 PDFBibTeX XMLCite \textit{M. Gattinger} and \textit{G. Wenzel}, Methods Oper. Res. 40, 321--323 (1981; Zbl 0456.05034)
Smeds, Per A. Line digraphs and the Moore-Penrose inverse. (English) Zbl 0454.05030 Linear Algebra Appl. 36, 165-172 (1981). MSC: 05C20 05C50 15A09 PDFBibTeX XMLCite \textit{P. A. Smeds}, Linear Algebra Appl. 36, 165--172 (1981; Zbl 0454.05030) Full Text: DOI
Thomassen, Carsten Long cycles in digraphs. (English) Zbl 0454.05029 Proc. Lond. Math. Soc., III. Ser. 42, 231-251 (1981). MSC: 05C20 05C38 05C45 PDFBibTeX XMLCite \textit{C. Thomassen}, Proc. Lond. Math. Soc. (3) 42, 231--251 (1981; Zbl 0454.05029) Full Text: DOI
Pang, Jong-Shi; Lee, Patrick S. C. A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model. (English) Zbl 0441.90106 Math. Program. 20, 81-102 (1981). MSC: 90C90 91B50 90C33 PDFBibTeX XMLCite \textit{J.-S. Pang} and \textit{P. S. C. Lee}, Math. Program. 20, 81--102 (1981; Zbl 0441.90106) Full Text: DOI
Bridges, W. G.; Mena, R. A. \(X^k\)-digraphs. (English) Zbl 0403.05042 J. Comb. Theory, Ser. B 30, 136-143 (1981). MSC: 05C20 PDFBibTeX XMLCite \textit{W. G. Bridges} and \textit{R. A. Mena}, J. Comb. Theory, Ser. B 30, 136--143 (1981; Zbl 0403.05042) Full Text: DOI