Nyu, V.; Evdokimov, A. A. Coverings of graphs by routes. (Russian) Zbl 0591.05058 Metody Diskretn. Anal. 40, 72-86 (1983). MSC: 05C70 05C20 05C38 PDFBibTeX XMLCite \textit{V. Nyu} and \textit{A. A. Evdokimov}, Metody Diskretn. Anal. 40, 72--86 (1983; Zbl 0591.05058)
Stinson, D. R. A comparison of two invariants for Steiner triple systems: Fragments and trains. (English) Zbl 0562.05015 Ars Comb. 16, 69-76 (1983). Reviewer: A.Rosa MSC: 05B07 05C20 PDFBibTeX XMLCite \textit{D. R. Stinson}, Ars Comb. 16, 69--76 (1983; Zbl 0562.05015)
Marcu, D. Compatible and admissible potential functions of a network. (English) Zbl 0558.90098 Bul. Inst. Politeh. Bucur., Ser. Electron. 45, 13-16 (1983). MSC: 90C35 05C35 PDFBibTeX XMLCite \textit{D. Marcu}, Bul. Inst. Politeh. Bucur., Ser. Electron. 45, 13--16 (1983; Zbl 0558.90098)
Berge, C. Sur le nombre minimum d’arcs à inverser pour rendre un graphe fortement connexe: Application à un problème de trafic. (French) Zbl 0558.05023 Cah. Cent. Étud. Rech. Opér. 25, 183-186 (1983). Reviewer: W.Mader MSC: 05C20 05C35 05C40 PDFBibTeX XMLCite \textit{C. Berge}, Cah. Cent. Étud. Rech. Opér. 25, 183--186 (1983; Zbl 0558.05023)
Benhocine, Abdelhamid; Wojda, A. Pawel Bypasses in digraphs. (English) Zbl 0556.05034 Ars Comb. 16, 85-94 (1983). Reviewer: B.Alspach MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{A. Benhocine} and \textit{A. P. Wojda}, Ars Comb. 16, 85--94 (1983; Zbl 0556.05034)
Topp, Jerzy Asymmetric games on digraphs. (English) Zbl 0544.05031 Graph theory, Proc. Conf., Łagów/Pol. 1981, Lect. Notes Math. 1018, 260-265 (1983). Reviewer: P.Avery MSC: 05C20 91A05 PDFBibTeX XML
Minezaki, Toshiya; Narushima, Hiroshi The number table of the coefficients of the command flow polynomial on a Boolean lattice. (English) Zbl 0543.05004 Proc. Fac. Sci. Tokai Univ. 18, 17-22 (1983). Reviewer: V.V.Gorlov MSC: 05A15 05C20 06E99 PDFBibTeX XMLCite \textit{T. Minezaki} and \textit{H. Narushima}, Proc. Fac. Sci. Tokai Univ. 18, 17--22 (1983; Zbl 0543.05004)
Plesník, Ján Transmission in graphs and digraphs. (English) Zbl 0541.05056 Graphs and other combinatorial topics. Proc. 3rd Czech. Symp., Prague 1982, Teubner-Texte Math. 59, 216-219 (1983). Reviewer: R.C.Entringer MSC: 05C99 05C20 PDFBibTeX XML
Heinrich, Katherine Partitioning oriented 2-paths. (English) Zbl 0536.05052 J. Graph Theory 7, 359-367 (1983). Reviewer: V.Peteanu MSC: 05C70 05C20 05C38 PDFBibTeX XMLCite \textit{K. Heinrich}, J. Graph Theory 7, 359--367 (1983; Zbl 0536.05052) Full Text: DOI
Samardžiski, A.; Celakoski, N. A note on normed directed multigraphs and unary algebras. (English) Zbl 0532.05059 Proc. 3rd Algebraic Conf., Beograd 1982, 123-129 (1983). Reviewer: C.R.J.Clapham MSC: 05C99 05C20 08A60 PDFBibTeX XML
Narushima, Hiroshi; Kusaka, Yukio A move problem of weighted digraphs. (English) Zbl 0531.05053 Proc. Fac. Sci. Tokai Univ. 18, 23-27 (1983). Reviewer: J.Schwarze MSC: 05C99 05C20 94C15 PDFBibTeX XMLCite \textit{H. Narushima} and \textit{Y. Kusaka}, Proc. Fac. Sci. Tokai Univ. 18, 23--27 (1983; Zbl 0531.05053)
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
Rosenberg, I. G. Cycle structure of affine transformations of vector spaces over GF(p). (English) Zbl 0526.15002 Ann. Discrete Math. 17, 575-579 (1983). MSC: 15A04 05C20 08A35 PDFBibTeX XMLCite \textit{I. G. Rosenberg}, Ann. Discrete Math. 17, 575--579 (1983; Zbl 0526.15002) Full Text: DOI
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)
Heydemann, M. C. Nombre maximum d’arcs d’un graphe antisymetrique sans chemin de longueur l. (French) Zbl 0522.05029 Ann. Discrete Math. 17, 337-346 (1983). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{M. C. Heydemann}, Ann. Discrete Math. 17, 337--346 (1983; Zbl 0522.05029) Full Text: DOI
Ayel, Jacqueline Degrees and longest paths in bipartite digraphs. (English) Zbl 0522.05028 Ann. Discrete Math. 17, 33-38 (1983). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{J. Ayel}, Ann. Discrete Math. 17, 33--38 (1983; Zbl 0522.05028) Full Text: DOI
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