Topp, J.; Ulatowski, W. On functions which sum to zero on semicycles. (English) Zbl 0719.05044 Zastosow. Mat. 19, No. 3-4, 611-617 (1987). MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{J. Topp} and \textit{W. Ulatowski}, Zastosow. Mat. 19, No. 3--4, 611--617 (1987; Zbl 0719.05044)
Eremin, G. S. Partitioning the vertex set of an acyclic directed graph into convex subsets. (English. Russian original) Zbl 0692.05052 Autom. Remote Control 48, No. 8, 1085-1090 (1987); translation from Avtom. Telemekh. 1987, No. 8, 137-143 (1987). MSC: 05C70 05C20 PDFBibTeX XMLCite \textit{G. S. Eremin}, Autom. Remote Control 48, No. 8, 1085--1090 (1987; Zbl 0692.05052); translation from Avtom. Telemekh. 1987, No. 8, 137--143 (1987)
Anishev, P. A. A matrix algorithm of search for contours in a directed graph. (Russian) Zbl 0673.05043 Vychisl. Sist. 119, 62-70 (1987). Reviewer: V.Fleischer MSC: 05C20 68R10 PDFBibTeX XMLCite \textit{P. A. Anishev}, Vychisl. Sist. 119, 62--70 (1987; Zbl 0673.05043)
Brualdi, Richard A. Combinatorially determined elementary divisors. (English) Zbl 0662.05046 Combinatorics, graph theory, and computing, Proc. 18th Southeast. Conf., Boca Raton/Fl. 1987, Congr. Numerantium 58, 193-216 (1987). Reviewer: V.Fleischer MSC: 05C50 05C20 PDFBibTeX XML
Zelinka, Bohdan Natural bijections between directed and undirected self-complementary graphs. (English) Zbl 0659.05051 Math. Slovaca 37, 363-366 (1987). Reviewer: R.C.Read MSC: 05C20 05C30 05C75 PDFBibTeX XMLCite \textit{B. Zelinka}, Math. Slovaca 37, 363--366 (1987; Zbl 0659.05051) Full Text: EuDML
Song, Zengmin The longest path or cycle in digraph. (Chinese. English summary) Zbl 0655.05031 J. Nanjing Inst. Technol. 17, No. 4, 133-137 (1987). MSC: 05C20 05C38 05C35 PDFBibTeX XMLCite \textit{Z. Song}, J. Nanjing Inst. Technol. 17, No. 4, 133--137 (1987; Zbl 0655.05031)
McAllister, M. Luisa N. An algorithm for networks of rules. (English) Zbl 0654.68079 SIAM Rev. 29, 291-296 (1987). MSC: 68R10 94C15 68T99 PDFBibTeX XMLCite \textit{M. L. N. McAllister}, SIAM Rev. 29, 291--296 (1987; Zbl 0654.68079) Full Text: DOI
Min, Zhang Ke Longest paths and cycles in bipartite oriented graphs. (English) Zbl 0654.05046 J. Graph Theory 11, No. 3, 339-348 (1987). Reviewer: O.Oellermann MSC: 05C38 05C20 05C35 PDFBibTeX XMLCite \textit{Z. K. Min}, J. Graph Theory 11, No. 3, 339--348 (1987; Zbl 0654.05046) Full Text: DOI
Berman, K. A. Balanced vertex weightings and arborescences. (English) Zbl 0654.05040 J. Comb. Theory, Ser. B 42, 274-301 (1987). MSC: 05C25 PDFBibTeX XMLCite \textit{K. A. Berman}, J. Comb. Theory, Ser. B 42, 274--301 (1987; Zbl 0654.05040) Full Text: DOI
Chaudhuri, Pranay An algorithm for finding all triangles in a digraph in parallel. (English) Zbl 0653.05035 Pure Appl. Math. Sci. 25, No. 1-2, 27-35 (1987). MSC: 05C20 05-04 PDFBibTeX XMLCite \textit{P. Chaudhuri}, Pure Appl. Math. Sci. 25, No. 1--2, 27--35 (1987; Zbl 0653.05035)
Jones, Kathryn F.; Lundgren, J. Richard; Roberts, Fred S.; Seager, Suzanne Some remarks on the double competition number of a graph. (English) Zbl 0652.05022 Combinatorics, graph theory, and computing, Proc. 18th Southeast. Conf., Boca Raton/Fl. 1987, Congr. Numerantium 60, 17-24 (1987). MSC: 05C20 05C50 PDFBibTeX XML
Chao, Chong-Yun; Li, Nianzu; Zhang, Moucheng On digraphs with nilpotent adjacency matrices. (English) Zbl 0649.05033 Bull. Malays. Math. Soc., II. Ser. 10, No. 1, 29-37 (1987). MSC: 05C20 05C50 PDFBibTeX XMLCite \textit{C.-Y. Chao} et al., Bull. Malays. Math. Soc., II. Ser. 10, No. 1, 29--37 (1987; Zbl 0649.05033)
Nakayama, A.; Peroche, B. Linear arboricity of digraphs. (English) Zbl 0649.05029 Networks 17, No. 1, 39-53 (1987). MSC: 05C20 05C05 05C38 PDFBibTeX XMLCite \textit{A. Nakayama} and \textit{B. Peroche}, Networks 17, No. 1, 39--53 (1987; Zbl 0649.05029) Full Text: DOI
Bloom, Gary S.; Burr, Stefan A. On unavoidable digraphs in orientations of graphs. (English) Zbl 0647.05025 J. Graph Theory 11, No. 4, 453-462 (1987). Reviewer: J.W.Moon MSC: 05C20 PDFBibTeX XMLCite \textit{G. S. Bloom} and \textit{S. A. Burr}, J. Graph Theory 11, No. 4, 453--462 (1987; Zbl 0647.05025) Full Text: DOI
Perl, Yehoshua Digraphs with maximum number of paths and cycles. (English) Zbl 0645.90094 Networks 17, No. 3, 295-305 (1987). MSC: 90C35 90B10 05C38 PDFBibTeX XMLCite \textit{Y. Perl}, Networks 17, No. 3, 295--305 (1987; Zbl 0645.90094) Full Text: DOI
Szwarcfiter, Jayme Luiz On the many-visits traveling salesman problem. (English) Zbl 0645.90089 Proc. 15th Braz. Colloq. Math., Poços de Caldas/Braz. 1985, 179-186 (1987). Reviewer: N.Ivanov MSC: 90C35 90C10 68Q25 PDFBibTeX XML
Gambosi, G.; Nešetřil, Jaroslav; Talamo, M. Posets, Boolean representations and quick path searching. (English) Zbl 0642.68116 Automata, languages and programming, Proc. 14th Int. Colloq., Karlsruhe/FRG 1987, Lect. Notes Comput. Sci. 267, 404-424 (1987). MSC: 68P10 68Q25 94C10 06A06 PDFBibTeX XML
Bouchet, André Digraph decompositions and Eulerian systems. (English) Zbl 0641.05019 SIAM J. Algebraic Discrete Methods 8, 323-337 (1987). Reviewer: P.Horák MSC: 05C20 PDFBibTeX XMLCite \textit{A. Bouchet}, SIAM J. Algebraic Discrete Methods 8, 323--337 (1987; Zbl 0641.05019) Full Text: DOI
Jaworski, Jerzy; Smit, Ipe H. On a random digraph. (English) Zbl 0633.05030 Random graphs, ’85, Lect. 2nd Int. Semin., Poznań/Pol. 1985, Ann. Discrete Math. 33, 111-127 (1987). Reviewer: J.W.Moon MSC: 05C20 05C30 05C40 05C80 PDFBibTeX XML
Jackson, Bill A Chvátal-Erdős condition for Hamilton cycles in digraphs. (English) Zbl 0632.05037 J. Comb. Theory, Ser. B 43, 245-252 (1987). Reviewer: M.Koman MSC: 05C45 05C40 05C20 PDFBibTeX XMLCite \textit{B. Jackson}, J. Comb. Theory, Ser. B 43, 245--252 (1987; Zbl 0632.05037) Full Text: DOI
Song, Zhenmin Number of arcs and cycles in digraphs. (Chinese. English summary) Zbl 0632.05029 J. Nanjing Inst. Technol. 17, No. 2, 121-125 (1987). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{Z. Song}, J. Nanjing Inst. Technol. 17, No. 2, 121--125 (1987; Zbl 0632.05029)
Shao, Jiayu The exponent set of symmetric primitive matrices. (English) Zbl 0628.15017 Sci. Sin., Ser. A 30, 348-358 (1987). Reviewer: Yueh-er Kuo MSC: 15B48 15A30 05C20 15A15 PDFBibTeX XMLCite \textit{J. Shao}, Sci. Sin., Ser. A 30, 348--358 (1987; Zbl 0628.15017)
Darbinyan, S. Kh. On special contours of digraphs. (Russian) Zbl 0627.05029 Dokl., Akad. Nauk Arm. SSR 84, 51-55 (1987). Reviewer: J.Širáň MSC: 05C20 PDFBibTeX XMLCite \textit{S. Kh. Darbinyan}, Dokl., Akad. Nauk Arm. SSR 84, 51--55 (1987; Zbl 0627.05029)
Barrett, Wayne W.; Johnson, Charles R.; Olesky, D. D.; Van den Driessche, P. Inherited matrix entries: Principal submatrices of the inverse. (English) Zbl 0626.05040 SIAM J. Algebraic Discrete Methods 8, 313-322 (1987). MSC: 05C50 15A09 65F50 68R10 PDFBibTeX XMLCite \textit{W. W. Barrett} et al., SIAM J. Algebraic Discrete Methods 8, 313--322 (1987; Zbl 0626.05040) Full Text: DOI Link
Hoàng, C. T.; Reed, B. A note on short cycles in digraphs. (English) Zbl 0626.05021 Discrete Math. 66, 103-107 (1987). Reviewer: J.W.Moon MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{C. T. Hoàng} and \textit{B. Reed}, Discrete Math. 66, 103--107 (1987; Zbl 0626.05021) Full Text: DOI
Gould, Ronald J.; Roth, Robert Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\). (English) Zbl 0626.05020 Discrete Math. 66, 91-102 (1987). Reviewer: J.W.Moon MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{R. J. Gould} and \textit{R. Roth}, Discrete Math. 66, 91--102 (1987; Zbl 0626.05020) Full Text: DOI
Zelinka, Bohdan Neighbourhood digraphs. (English) Zbl 0626.05018 Arch. Math., Brno 23, 69-70 (1987). MSC: 05C20 PDFBibTeX XMLCite \textit{B. Zelinka}, Arch. Math., Brno 23, 69--70 (1987; Zbl 0626.05018) Full Text: EuDML
Jirásek, Jozef On a certain class of multidigraphs, for which reversal of no arc decreases the number of their cycles. (English) Zbl 0624.05034 Commentat. Math. Univ. Carol. 28, 185-189 (1987). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{J. Jirásek}, Commentat. Math. Univ. Carol. 28, 185--189 (1987; Zbl 0624.05034) Full Text: EuDML
Egawa, Yoshimi; Miyamoto, Takashi; Ruiz, Sergio On randomly n-cyclic digraphs. (English) Zbl 0623.05021 Graphs Comb. 3, 227-238 (1987). Reviewer: O.Frank MSC: 05C20 05C38 05C45 PDFBibTeX XMLCite \textit{Y. Egawa} et al., Graphs Comb. 3, 227--238 (1987; Zbl 0623.05021) Full Text: DOI
Duchet, Pierre; Hamidoune, Yahya Ould; Meyniel, Henry Sur les quasi-noyaux d’un graphe. (On quasi-kernels of a graph). (French) Zbl 0623.05020 Discrete Math. 65, 231-235 (1987). Reviewer: G.Chaty MSC: 05C20 PDFBibTeX XMLCite \textit{P. Duchet} et al., Discrete Math. 65, 231--235 (1987; Zbl 0623.05020) Full Text: DOI
Duchet, P.; Kaneti, V. Sur la contraction des graphes orientés en \(K^ *_ 3\). (On the contraction of digraphs onto \(K^ *_ 3)\). (French) Zbl 0623.05019 Discrete Math. 65, 95-98 (1987). Reviewer: G.Chaty MSC: 05C20 PDFBibTeX XMLCite \textit{P. Duchet} and \textit{V. Kaneti}, Discrete Math. 65, 95--98 (1987; Zbl 0623.05019) Full Text: DOI
Arlinghaus, W. C.; Harary, F. The digraph number of a finite Abelian group. (English) Zbl 0617.05033 Wiss. Z. Tech. Hochsch. Ilmenau 33, No. 1, 25-31 (1987). MSC: 05C25 05C35 PDFBibTeX XMLCite \textit{W. C. Arlinghaus} and \textit{F. Harary}, Wiss. Z. Tech. Hochsch. Ilmenau 33, No. 1, 25--31 (1987; Zbl 0617.05033)
Li, Zhijie A matrix representation for the overall planning network and relative calculations. (Chinese. English summary) Zbl 0617.05032 Acta Math. Appl. Sin. 10, 117-120 (1987). Reviewer: Wai-Kai Chen MSC: 05C20 94C15 90B22 PDFBibTeX XMLCite \textit{Z. Li}, Acta Math. Appl. Sin. 10, 117--120 (1987; Zbl 0617.05032)
Kano, Mikio Ranking the vertices of an r-partite paired comparison digraph. (English) Zbl 0617.05031 Discrete Appl. Math. 17, 245-253 (1987). Reviewer: P.Horák MSC: 05C20 PDFBibTeX XMLCite \textit{M. Kano}, Discrete Appl. Math. 17, 245--253 (1987; Zbl 0617.05031) Full Text: DOI
Hwang, F. K. The Hamiltonian property of linear functions. (English) Zbl 0615.05033 Oper. Res. Lett. 6, 125-127 (1987). MSC: 05C20 05C45 PDFBibTeX XMLCite \textit{F. K. Hwang}, Oper. Res. Lett. 6, 125--127 (1987; Zbl 0615.05033) Full Text: DOI
Sánchez-Flores, Adolfo A counterexample to a generalization of Richardson’s theorem. (English) Zbl 0613.05025 Discrete Math. 65, 319-320 (1987). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{A. Sánchez-Flores}, Discrete Math. 65, 319--320 (1987; Zbl 0613.05025) Full Text: DOI
Donald, John; Elwin, John; Hager, Richard; Salamon, Peter Handle bases and bounds on the number of subgraphs. (English) Zbl 0612.05035 J. Comb. Theory, Ser. B 42, 1-13 (1987). Reviewer: J.Sedláček MSC: 05C20 05C38 15A15 PDFBibTeX XMLCite \textit{J. Donald} et al., J. Comb. Theory, Ser. B 42, 1--13 (1987; Zbl 0612.05035) Full Text: DOI
Scott, Debra D. The competition-common enemy graph of a digraph. (English) Zbl 0609.05038 Discrete Appl. Math. 17, 269-280 (1987). MSC: 05C20 PDFBibTeX XMLCite \textit{D. D. Scott}, Discrete Appl. Math. 17, 269--280 (1987; Zbl 0609.05038) Full Text: DOI
Bognár, M. Walking in finite directed graphs. (English) Zbl 0573.05024 Stud. Sci. Math. Hung. 22, No. 1-4, 305-313 (1987). MSC: 05C20 94C15 68R10 05C38 PDFBibTeX XMLCite \textit{M. Bognár}, Stud. Sci. Math. Hung. 22, No. 1--4, 305--313 (1987; Zbl 0573.05024)