Cosmadakis, Stavros S.; Papadimitriou, Christos H. The traveling salesman problem with many visits to few cities. (English) Zbl 0529.90091 SIAM J. Comput. 13, 99-108 (1984). MSC: 90C35 90C39 68Q25 90B10 90C10 PDFBibTeX XMLCite \textit{S. S. Cosmadakis} and \textit{C. H. Papadimitriou}, SIAM J. Comput. 13, 99--108 (1984; Zbl 0529.90091) Full Text: DOI
Fiol, Miguel A.; Yebra, J. Luis Andres; Alegre de Miquel, Ignacio Line digraph iterations and the (d,k) digraph problem. (English) Zbl 0528.68048 IEEE Trans. Comput. 33, 400-403 (1984). MSC: 68R10 94C15 PDFBibTeX XMLCite \textit{M. A. Fiol} et al., IEEE Trans. Comput. 33, 400--403 (1984; Zbl 0528.68048) Full Text: DOI
Zhang, Fuji; Lin, Guoning A graphic method for generating all Euler tours of an Eulerian digraph. (Chinese) Zbl 0529.05032 J. Lanzhou Univ., Nat. Sci. 1983, No. 2, 1-9 (1983). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{F. Zhang} and \textit{G. Lin}, J. Lanzhou Univ., Nat. Sci. 1983, No. 2, 1--9 (1983; Zbl 0529.05032)
Taraszow, Oleg G. Enumeration of acyclic supertournaments of a finite, labeled, acyclic digraph. (English) Zbl 0528.05035 Graphs and other combinatorial topics. Proc. 3rd Czech. Symp., Prague 1982, Teubner-Texte Math. 59, 320-324 (1983). MSC: 05C20 05C30 PDFBibTeX XML
Kwasnik, Maria On the (k;l)-kernels. (English) Zbl 0528.05033 Graph theory, Proc. Conf., Lagow/Pol. 1981, Lect. Notes Math. 1018, 114-121 (1983). MSC: 05C20 05C38 PDFBibTeX XML
Fiedler, Miroslav Combinatorial properties of sign-patterns in some classes of matrices. (English) Zbl 0528.05031 Graph theory, Proc. Conf., Lagow/Pol. 1981, Lect. Notes Math. 1018, 28-32 (1983). MSC: 05C20 05B20 PDFBibTeX XML
Havel, Ivan Embedding graphs in undirected and directed cubes. (English) Zbl 0527.05058 Graph theory, Proc. Conf., Lagow/Pol. 1981, Lect. Notes Math. 1018, 60-68 (1983). MSC: 05C99 05C20 PDFBibTeX XML
Dawes, A. M.; Florence, J. B. Graph dismantling problems. (English) Zbl 0527.05057 J. Graph Theory 7, 335-367 (1983). MSC: 05C99 05C20 68R10 PDFBibTeX XMLCite \textit{A. M. Dawes} and \textit{J. B. Florence}, J. Graph Theory 7, 335--367 (1983; Zbl 0527.05057) Full Text: DOI
Casas, R.; Diaz, J.; Verges, M. Compacting binary trees. (English) Zbl 0527.05025 Graphs and other combinatorial topics, Proc. 3rd Czech. Symp., Prague 1982, Teubner-Texte Math. 59, 23-29 (1983). MSC: 05C05 05C30 PDFBibTeX XML
Lucchesi, Claudio L.; Ross, Jeffrey A. Superfluous paths in strong digraphs. (English) Zbl 0526.05028 Discrete Math. 47, 267-273 (1983). MSC: 05C20 05C38 05C40 PDFBibTeX XMLCite \textit{C. L. Lucchesi} and \textit{J. A. Ross}, Discrete Math. 47, 267--273 (1983; Zbl 0526.05028) Full Text: DOI
Bhat, Kabekode V. S. An efficient approach for fault diagnosis in a Boolean n-cube array of microprocessors. (English) Zbl 0525.94027 IEEE Trans. Comput. 32, 1070-1071 (1983). MSC: 94C10 94C15 68N25 PDFBibTeX XMLCite \textit{K. V. S. Bhat}, IEEE Trans. Comput. 32, 1070--1071 (1983; Zbl 0525.94027) Full Text: DOI
Dragan, I. Greedy and optimal paths in a weighted graph without circuits. (English) Zbl 0525.90091 Libertas Math. 3, 129-147 (1983). MSC: 90C35 05C35 PDFBibTeX XMLCite \textit{I. Dragan}, Libertas Math. 3, 129--147 (1983; Zbl 0525.90091)
Harary, Frank; Plantholt, Michael The derived signed graph of a digraph. (English) Zbl 0525.05030 Expo. Math. 1, 343-347 (1983). MSC: 05C20 05C99 PDFBibTeX XMLCite \textit{F. Harary} and \textit{M. Plantholt}, Expo. Math. 1, 343--347 (1983; Zbl 0525.05030)
Bielak, Halina; Soczewinska, Elzbieta Some remarks about digraphs with non-isomorphic 1- or 2-neighbourhoods. (English) Zbl 0525.05028 Cas. Pěst. Mat. 108, 299-304 (1983). MSC: 05C20 PDFBibTeX XMLCite \textit{H. Bielak} and \textit{E. Soczewinska}, Čas. Pěstování Mat. 108, 299--304 (1983; Zbl 0525.05028) Full Text: EuDML
Eisenfeld, J.; Grundy, S. M. Structural identification of large systems by reduction to subsystems: VLDL triglycerides. (English) Zbl 0523.92009 Math. Biosci. 66, 129-149 (1983). MSC: 92Cxx 93B30 93A15 PDFBibTeX XMLCite \textit{J. Eisenfeld} and \textit{S. M. Grundy}, Math. Biosci. 66, 129--149 (1983; Zbl 0523.92009) Full Text: DOI Link
Penn, Laurence E.; Witte, David When the Cartesian product of two directed cycles is hypo-Hamiltonian. (English) Zbl 0523.05049 J. Graph Theory 7, 441-443 (1983). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{L. E. Penn} and \textit{D. Witte}, J. Graph Theory 7, 441--443 (1983; Zbl 0523.05049) Full Text: DOI
Jaworski, Jerzy On the connectedness of a random bipartite mapping. (English) Zbl 0522.05057 Graph theory, Proc. Conf., Lagow/Pol. 1981, Lect. Notes Math. 1018, 69-74 (1983). MSC: 05C80 05C40 60E99 PDFBibTeX XML
Zhang, Cunquan Arc-disjoint Hamiltonian circuit and path in digraphs. (Chinese) Zbl 0522.05043 Acta Math. Sin. 26, 451-456 (1983). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{C. Zhang}, Acta Math. Sin. 26, 451--456 (1983; Zbl 0522.05043)
Er, M. C. A parallel computation approach to topological sorting. (English) Zbl 0521.68069 Comput. J. 26, 293-295 (1983). MSC: 68P10 68R10 68N25 PDFBibTeX XMLCite \textit{M. C. Er}, Comput. J. 26, 293--295 (1983; Zbl 0521.68069) Full Text: DOI
Ramachandran, S. N-reconstructibility of non-reconstructible digraphs. (English) Zbl 0519.05049 Discrete Math. 46, 279-294 (1983). MSC: 05C60 05C20 PDFBibTeX XMLCite \textit{S. Ramachandran}, Discrete Math. 46, 279--294 (1983; Zbl 0519.05049) Full Text: DOI
Ndaw, Babacar Alassane; Sarr, Amadou The problem of reciprocity in a Delastelle digraphic substitution. (English) Zbl 0518.94013 Cryptologia 7, 170-179 (1983). MSC: 94A99 05C20 94A05 94A15 PDFBibTeX XMLCite \textit{B. A. Ndaw} and \textit{A. Sarr}, Cryptologia 7, 170--179 (1983; Zbl 0518.94013) Full Text: DOI
Horak, Peter A note on removing a point of a strong digraph. (English) Zbl 0517.05035 Math. Slovaca 33, 85-86 (1983). MSC: 05C20 05C38 05C40 PDFBibTeX XMLCite \textit{P. Horak}, Math. Slovaca 33, 85--86 (1983; Zbl 0517.05035) Full Text: EuDML
Wang, Kai Characteristic polynomials of symmetric graphs. (English) Zbl 0516.05038 Linear Algebra Appl. 51, 121-125 (1983). MSC: 05C50 05C25 15A18 PDFBibTeX XMLCite \textit{K. Wang}, Linear Algebra Appl. 51, 121--125 (1983; Zbl 0516.05038) Full Text: DOI
Zelinka, Bohdan Nearly acyclic digraphs. (English) Zbl 0515.05034 Czech. Math. J. 33(108), 164-165 (1983). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{B. Zelinka}, Czech. Math. J. 33(108), 164--165 (1983; Zbl 0515.05034) Full Text: EuDML
Inagaki, Toshiyuki; Himmelblau, David M. Hierarchical determination of precedence order and representation of digraphs. (English) Zbl 0509.94032 IEEE Trans. Syst. Man Cybern. 13, 406-413 (1983). MSC: 94C15 94C10 PDFBibTeX XMLCite \textit{T. Inagaki} and \textit{D. M. Himmelblau}, IEEE Trans. Syst. Man Cybern. 13, 406--413 (1983; Zbl 0509.94032) Full Text: DOI
Hoffman, A. J. Extending Greene’s theorem to directed graphs. (English) Zbl 0509.05041 J. Comb. Theory, Ser. A 34, 102-107 (1983). MSC: 05C20 05C15 06A06 PDFBibTeX XMLCite \textit{A. J. Hoffman}, J. Comb. Theory, Ser. A 34, 102--107 (1983; Zbl 0509.05041) Full Text: DOI
Chen, C. C.; Manalastas, P. jun. Every finite strongly connected digraph of stability 2 has a Hamiltonian path. (English) Zbl 0507.05036 Discrete Math. 44, 243-250 (1983). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{C. C. Chen} and \textit{P. Manalastas jun.}, Discrete Math. 44, 243--250 (1983; Zbl 0507.05036) Full Text: DOI
Kano, Mikio; Sakamoto, Akio Ranking the vertices of a weighted digraph using the length of forward arcs. (English) Zbl 0507.05035 Networks 13, 143-151 (1983). MSC: 05C20 05C35 05C99 PDFBibTeX XMLCite \textit{M. Kano} and \textit{A. Sakamoto}, Networks 13, 143--151 (1983; Zbl 0507.05035) Full Text: DOI
Witte, David; Letzter, Gail; Gallian, Joseph A. On Hamiltonian circuits in Cartesian products of Cayley digraphs. (English) Zbl 0503.05041 Discrete Math. 43, 297-307 (1983). MSC: 05C45 05C20 05C25 PDFBibTeX XMLCite \textit{D. Witte} et al., Discrete Math. 43, 297--307 (1983; Zbl 0503.05041) Full Text: DOI
Cai, Mao-cheng A counterexample to a conjecture of Grant. (English) Zbl 0502.05028 Discrete Math. 44, 111 (1983). MSC: 05C20 05C45 PDFBibTeX XMLCite \textit{M.-c. Cai}, Discrete Math. 44, 111 (1983; Zbl 0502.05028) Full Text: DOI
Wiener, Gerry Some structural results concerning certain classes of qualitative matrices and their inverses. (English) Zbl 0527.05049 Linear Algebra Appl. 48, 161-175 (1982). MSC: 05C30 05C20 PDFBibTeX XMLCite \textit{G. Wiener}, Linear Algebra Appl. 48, 161--175 (1982; Zbl 0527.05049) Full Text: DOI
Darbinyan, S. Kh. Cycles of arbitrary length in digraphs with large semi degrees. (Russian) Zbl 0526.05027 Dokl. Akad. Nauk Arm. SSR 75, 147-152 (1982). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{S. Kh. Darbinyan}, Dokl., Akad. Nauk Arm. SSR 75, 147--152 (1982; Zbl 0526.05027)
Lachlan, A. H. Finite homogeneous simple digraphs. (English) Zbl 0518.05037 Logic colloquium ’81, Proc. Herbrand Symp., Marseille 1981, Stud. Logic Found. Math. 107, 189-208 (1982). MSC: 05C20 05C99 PDFBibTeX XML
Bautz, Manfred; Piehler, Joachim Über Eigenschaften spezieller Graphen. (German) Zbl 0515.05046 Wiss. Z. Tech. Hochsch. Carl Schorlemmer Leuna-Merseburg 24, 544-553 (1982). MSC: 05C50 05C20 PDFBibTeX XMLCite \textit{M. Bautz} and \textit{J. Piehler}, Wiss. Z. Tech. Hochsch. Carl Schorlemmer Leuna-Merseburg 24, 544--553 (1982; Zbl 0515.05046)
Topp, Jerzy Grundy functions of line digraphs. (English) Zbl 0515.05032 Zesz. Nauk. Politech. Gdań. 345, Mat. 12, 63-66 (1982). MSC: 05C20 PDFBibTeX XML
Arney, James; Bender, Edward A. Random mappings with constraints on coalescence and number of origins. (English) Zbl 0514.05033 Pac. J. Math. 103, 269-294 (1982). MSC: 05C20 05C80 60F05 PDFBibTeX XMLCite \textit{J. Arney} and \textit{E. A. Bender}, Pac. J. Math. 103, 269--294 (1982; Zbl 0514.05033) Full Text: DOI
Opsut, Robert J. On the computation of the competition number of a graph. (English) Zbl 0512.05032 SIAM J. Algebraic Discrete Methods 3, 420-428 (1982). MSC: 05C20 05C99 68Q25 PDFBibTeX XMLCite \textit{R. J. Opsut}, SIAM J. Algebraic Discrete Methods 3, 420--428 (1982; Zbl 0512.05032) Full Text: DOI
Ihm, H. S.; Ntafos, S. C. On finding legal paths in the presence of impossible paths. (English) Zbl 0511.68027 Combinatorics, graph theory and computing, Proc. 13th Southeast. Conf., Boca Raton 1982, Congr. Numerantium 36, 311-323 (1982). MSC: 68Q25 68R10 68N99 PDFBibTeX XML
Srimani, Pradip K.; Sinha, Bhabani P. Impossible pair constrained test path generation in a program. (English) Zbl 0509.68062 Inf. Sci. 28, 87-103 (1982). MSC: 68R10 68N01 PDFBibTeX XMLCite \textit{P. K. Srimani} and \textit{B. P. Sinha}, Inf. Sci. 28, 87--103 (1982; Zbl 0509.68062) Full Text: DOI
Marcu, Danut On the even elementary circuits and cycles of a digraph. (English) Zbl 0509.05049 Bul. Inst. Politeh. Bucur., Ser. Chim. -Metal. 44, No. 1, 21-26 (1982). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{D. Marcu}, Bul. Inst. Politeh. Bucur., Ser. Chim.-Metal. 44, No. 1, 21--26 (1982; Zbl 0509.05049)
Howalla, K.; Dabboucy, A. N.; Tout, R. On the maximum number of arcs in some classes of graphs. (English) Zbl 0509.05044 Cas. Pěst. Mat. 107, 388-392 (1982). MSC: 05C20 PDFBibTeX XMLCite \textit{K. Howalla} et al., Čas. Pěstování Mat. 107, 388--392 (1982; Zbl 0509.05044) Full Text: EuDML
Marcu, Danut Generalized kernels with considerations to the tournament digraphs. (English) Zbl 0508.05039 Math., Rev. Anal. Numér. Théor. Approximation, Math. 24(47), 57-63 (1982). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{D. Marcu}, Math. Rev. Anal. Numér. Théor. Approximation, Math. 24(47), 57--63 (1982; Zbl 0508.05039)
Madden, Daniel J.; Vélez, William Yslas Polynomials that represent quadratic residues at primitive roots. (English) Zbl 0507.12015 Pac. J. Math. 98, 123-137 (1982). MSC: 11T06 11T55 05C20 PDFBibTeX XMLCite \textit{D. J. Madden} and \textit{W. Y. Vélez}, Pac. J. Math. 98, 123--137 (1982; Zbl 0507.12015) Full Text: DOI
Blass, Andreas; Harary, Frank Deletion versus alteration in finite structures. (English) Zbl 0506.05038 J. Comb. Inf. Syst. Sci. 7, 139-142 (1982). MSC: 05C35 05C20 05C99 PDFBibTeX XMLCite \textit{A. Blass} and \textit{F. Harary}, J. Comb. Inf. Syst. Sci. 7, 139--142 (1982; Zbl 0506.05038)
Trubin, V. A. An algorithm for solving the Steiner problem on graphs. (Russian) Zbl 0504.05060 Mat. Issled. 68, 151-157 (1982). MSC: 05C99 68W99 68R10 PDFBibTeX XMLCite \textit{V. A. Trubin}, Mat. Issled. 68, 151--157 (1982; Zbl 0504.05060)
Kornienko, N. M. On Hamiltonian completion of some classes of graphs. (Russian) Zbl 0503.05035 Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk 1982, No. 4, 18-22 (1982). MSC: 05C35 05C45 68W99 PDFBibTeX XMLCite \textit{N. M. Kornienko}, Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk 1982, No. 4, 18--22 (1982; Zbl 0503.05035)
Chao, Chong-Yun; Wells, Jacqueline G. A class of vertex-transitive digraphs. II. (English) Zbl 0497.05033 J. Comb. Theory, Ser. B 32, 336-346 (1982). MSC: 05C25 05C30 05C20 PDFBibTeX XMLCite \textit{C.-Y. Chao} and \textit{J. G. Wells}, J. Comb. Theory, Ser. B 32, 336--346 (1982; Zbl 0497.05033) Full Text: DOI
Cunningham, William H. Decomposition of directed graphs. (English) Zbl 0497.05031 SIAM J. Algebraic Discrete Methods 3, 214-228 (1982). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{W. H. Cunningham}, SIAM J. Algebraic Discrete Methods 3, 214--228 (1982; Zbl 0497.05031) Full Text: DOI
Balakrishnan, R.; Sudharsanam, N. Extension of the Chvatal-Lovasz theorem to locally-finite infinite digraphs. (English) Zbl 0497.05030 Natl. Acad. Sci. Lett. 5, 163-164 (1982). MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{R. Balakrishnan} and \textit{N. Sudharsanam}, Natl. Acad. Sci. Lett. 5, 163--164 (1982; Zbl 0497.05030)
Watatani, Yasuo A graph theory for C*-algebras. (English) Zbl 0496.46036 Operator algebras and applications, Proc. Symp. Pure Math. 38, Part 1, Kingston/Ont. 1980, 195-197 (1982). MSC: 46L05 46L40 05C20 60J27 PDFBibTeX XML
Webb, Ursula Martin An independence result for group automorphisms. (English) Zbl 0495.20016 J. Algebra 79, 60-67 (1982). MSC: 20F28 20F29 05C25 05C20 PDFBibTeX XMLCite \textit{U. M. Webb}, J. Algebra 79, 60--67 (1982; Zbl 0495.20016) Full Text: DOI
Keating, Kevin The conjunction of Cayley digraphs. (English) Zbl 0495.05030 Discrete Math. 42, 209-219 (1982). MSC: 05C25 05C45 05C99 05C20 PDFBibTeX XMLCite \textit{K. Keating}, Discrete Math. 42, 209--219 (1982; Zbl 0495.05030) Full Text: DOI
Fraenkel, Aviezri S.; Yesha, Yaacov Theory of annihilation games. I. (English) Zbl 0493.90099 J. Comb. Theory, Ser. B 33, 60-86 (1982). MSC: 91A24 91A05 PDFBibTeX XMLCite \textit{A. S. Fraenkel} and \textit{Y. Yesha}, J. Comb. Theory, Ser. B 33, 60--86 (1982; Zbl 0493.90099) Full Text: DOI
Godsil, C. D. Eigenvalues of graphs and digraphs. (English) Zbl 0492.05032 Linear Algebra Appl. 46, 43-50 (1982). MSC: 05C25 05C20 05C50 PDFBibTeX XMLCite \textit{C. D. Godsil}, Linear Algebra Appl. 46, 43--50 (1982; Zbl 0492.05032) Full Text: DOI
Zimmermann, U. Minimization on submodular flows. (English) Zbl 0491.90041 Discrete Appl. Math. 4, 303-323 (1982). MSC: 90B10 90C35 90C48 65K05 PDFBibTeX XMLCite \textit{U. Zimmermann}, Discrete Appl. Math. 4, 303--323 (1982; Zbl 0491.90041) Full Text: DOI
Heydemann, M. C. Degrees and cycles in digraphs. (English) Zbl 0488.05040 Discrete Math. 41, 241-251 (1982). MSC: 05C20 05C38 05C35 PDFBibTeX XMLCite \textit{M. C. Heydemann}, Discrete Math. 41, 241--251 (1982; Zbl 0488.05040) Full Text: DOI
Mader, W. Konstruktion aller n-fach kantenzusammenhaengenden Digraphen. (German) Zbl 0488.05037 Eur. J. Comb. 3, 63-67 (1982). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{W. Mader}, Eur. J. Comb. 3, 63--67 (1982; Zbl 0488.05037) Full Text: DOI
Mueller, Heinrich Uniformly sparse random graphs. (English) Zbl 0486.05058 Interner Ber., Univ. Karlsruhe, Fak. Inf. 11/82, 25 p. (1982). MSC: 05C99 60C05 05C75 PDFBibTeX XML
Tao, Kuoting M.; Hsia, Pei On the structure of directed graphs with applications: A rapprochement with systems theory. I. (English) Zbl 0485.93004 Int. J. Gen. Syst. 8, 147-159 (1982). MSC: 93A10 05C20 93C55 93B05 93B07 93B20 93C05 93B40 PDFBibTeX XMLCite \textit{K. M. Tao} and \textit{P. Hsia}, Int. J. Gen. Syst. 8, 147--159 (1982; Zbl 0485.93004) Full Text: DOI
Martello, Silvano; Toth, Paolo Finding a minimum equivalent graph of a digraph. (English) Zbl 0484.68049 Networks 12, 89-100 (1982). MSC: 68R10 05C20 68Q25 PDFBibTeX XMLCite \textit{S. Martello} and \textit{P. Toth}, Networks 12, 89--100 (1982; Zbl 0484.68049) Full Text: DOI
Ayel, Jacqueline Longest paths in bipartite digraphs. (English) Zbl 0483.05041 Discrete Math. 40, 115-118 (1982). MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{J. Ayel}, Discrete Math. 40, 115--118 (1982; Zbl 0483.05041) Full Text: DOI
Beineke, Lowell W.; Zamfirescu, Christina M. Connection digraphs and second-order line digraphs. (English) Zbl 0483.05031 Discrete Math. 39, 237-254 (1982). MSC: 05C20 PDFBibTeX XMLCite \textit{L. W. Beineke} and \textit{C. M. Zamfirescu}, Discrete Math. 39, 237--254 (1982; Zbl 0483.05031) Full Text: DOI
Cogis, Olivier Ferrers digraphs and threshold graphs. (English) Zbl 0472.06006 Discrete Math. 38, 33-46 (1982). MSC: 06A06 06A15 05C10 05C20 PDFBibTeX XMLCite \textit{O. Cogis}, Discrete Math. 38, 33--46 (1982; Zbl 0472.06006) Full Text: DOI
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)
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
Guido, Cosimo First regular homotopy group of finite oriented graphs. (Italian) Zbl 0524.55012 Atti Accad. Sci. Lett. Arti Palermo, IV. Ser., Parte I 39(1982), 197-207 (1980). MSC: 55Q70 55Q05 05C99 PDFBibTeX XMLCite \textit{C. Guido}, Atti Accad. Sci. Lett. Arti Palermo, IV. Ser., Parte I 39, 197--207 (1980; Zbl 0524.55012)
Berman, Kenneth A. Proof of Tutte’s trinity theorem and a new determinant formula. (English) Zbl 0507.05055 SIAM J. Algebraic Discrete Methods 1, 64-69 (1980). MSC: 05C99 05C30 05C05 PDFBibTeX XMLCite \textit{K. A. Berman}, SIAM J. Algebraic Discrete Methods 1, 64--69 (1980; Zbl 0507.05055) Full Text: DOI