Rajan, Subbulakshmi S.; Arumugam, S. On forcibly unilaterally connected acyclic digraphic sequences. (English) Zbl 0855.05092 Math. Stud. 52(1984), No. 1-4, 251-252 (1990). MSC: 05C99 PDFBibTeX XMLCite \textit{S. S. Rajan} and \textit{S. Arumugam}, Math. Stud. 52, No. 1--4, 251--252 (1990; Zbl 0855.05092)
Hamidoune, Yahya Ould; Tindell, Ralph Vertex transitivity and super line connectedness. (English) Zbl 0789.05053 SIAM J. Discrete Math. 3, No. 4, 524-530 (1990). Reviewer: W. Mader (Hannover) MSC: 05C40 05C20 05C75 05C25 PDFBibTeX XMLCite \textit{Y. O. Hamidoune} and \textit{R. Tindell}, SIAM J. Discrete Math. 3, No. 4, 524--530 (1990; Zbl 0789.05053) Full Text: DOI
Cherkashin, S. P. On the structure of random digraphs with labelled edges. (English. Russian original) Zbl 0786.05076 Discrete Math. Appl. 2, No. 2, 225-234 (1992); translation from Diskretn. Mat. 2, No. 4, 82-91 (1990). MSC: 05C80 05C20 PDFBibTeX XMLCite \textit{S. P. Cherkashin}, Discrete Math. Appl. 2, No. 2, 225--234 (1990; Zbl 0786.05076); translation from Diskretn. Mat. 2, No. 4, 82--91 (1990) Full Text: DOI
Knyazev, A. V. Upper estimates of exponents of pseudosymmetric graphs. (Russian) Zbl 0747.05041 Diskretn. Mat. 2, No. 4, 63-71 (1990). Reviewer: P.Horak (Bratislava) MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{A. V. Knyazev}, Diskretn. Mat. 2, No. 4, 63--71 (1990; Zbl 0747.05041)
Stembridge, John R. Nonintersecting paths, pfaffians, and plane partitions. (English) Zbl 0790.05007 Adv. Math. 83, No. 1, 96-113 (1990). MSC: 05A15 05A17 05A19 05E10 11P83 05C20 05C38 PDFBibTeX XMLCite \textit{J. R. Stembridge}, Adv. Math. 83, No. 1, 96--113 (1990; Zbl 0790.05007) Full Text: DOI Link
Knyazev, A. V. Dichotomous graphs with maximal girth. (Russian) Zbl 0755.05040 Diskretn. Mat. 2, No. 3, 56-64 (1990). Reviewer: Jozef Širáň (Bratislava) MSC: 05C20 05C38 05C35 05C50 PDFBibTeX XMLCite \textit{A. V. Knyazev}, Diskretn. Mat. 2, No. 3, 56--64 (1990; Zbl 0755.05040)
Dyer, M. E.; Frieze, A. M. On patching algorithms for random asymmetric travelling salesman problems. (English) Zbl 0742.90064 Math. Program., Ser. A 46, No. 3, 361-378 (1990). Reviewer: F.Tian (Beijing) MSC: 90C27 90C35 90C60 90-08 PDFBibTeX XMLCite \textit{M. E. Dyer} and \textit{A. M. Frieze}, Math. Program. 46, No. 3 (A), 361--378 (1990; Zbl 0742.90064) Full Text: DOI
Šiljak, Dragoslav D. Decentralized control of complex systems. (English) Zbl 0728.93004 Mathematics in Science and Engineering, 184. Boston, MA etc.: Academic Press, Inc. xiv, 526 p. $ 74.95 (1990). Reviewer: L.Bakule (Praha) MSC: 93A14 93B52 93C15 93D30 93-02 PDFBibTeX XMLCite \textit{D. D. Šiljak}, Decentralized control of complex systems. Boston, MA etc.: Academic Press, Inc. (1990; Zbl 0728.93004)
Wagner, Klaus; Bodendiek, Rainer; Burosch, G.; Walther, G.; Walther, H.- J. [Širáň, J.] Graphentheorie. Band 2: Weitere Methoden, Masse-Graphen, Planarit t und minimale Graphen. (Graph Theory, Vol. 2: Further methods, mass-graphs, planarity and minimal graphs). (German) Zbl 0698.05002 Mannheim etc.: BI-Wissenschaftsverlag. x, 356 S. DM 54.00 (1990). Reviewer: J.Sedláček MSC: 05-01 05C10 05C99 05C35 06A06 PDFBibTeX XMLCite \textit{K. Wagner} et al., Graphentheorie. Band 2: Weitere Methoden, Masse-Graphen, Planarit t und minimale Graphen. (Graph Theory, Vol. 2: Further methods, mass-graphs, planarity and minimal graphs). Mannheim etc.: BI-Wissenschaftsverlag (1990; Zbl 0698.05002)
Marcu, Dănuţ Of finding the shortest paths of a digraph. (English) Zbl 0788.68109 Stud. Univ. Babeș-Bolyai, Math. 35, No. 3, 77-81 (1990). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{D. Marcu}, Stud. Univ. Babeș-Bolyai, Math. 35, No. 3, 77--81 (1990; Zbl 0788.68109)
Cherkashin, S. P. On the construction of random digraphs with marked edges. (Russian) Zbl 0749.05054 Diskretn. Mat. 2, No. 4, 82-91 (1990). Reviewer: V.Fleischer (Tartu) MSC: 05C80 05C20 PDFBibTeX XMLCite \textit{S. P. Cherkashin}, Diskretn. Mat. 2, No. 4, 82--91 (1990; Zbl 0749.05054)
Tomescu, Ioan Almost all digraphs have a kernel. (English) Zbl 0733.05046 Random graphs ’87, Proc. 3rd Int. Semin., Poznań/Poland 1987, 325-340 (1990). Reviewer: M.Harminc MSC: 05C20 05C80 PDFBibTeX XML
King, V. A lower bound for the recognition of digraph properties. (English) Zbl 0733.05041 Combinatorica 10, No. 1, 53-59 (1990). Reviewer: Wai Kai Chen MSC: 05C20 05C35 05C50 PDFBibTeX XMLCite \textit{V. King}, Combinatorica 10, No. 1, 53--59 (1990; Zbl 0733.05041) Full Text: DOI
Galeana-Sánchez, Hortensia On the existence of (k,\(\ell)\)-kernels in digraphs. (English) Zbl 0729.05020 Discrete Math. 85, No. 1, 99-102 (1990). Reviewer: J.Bang-Jensen (Odense) MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{H. Galeana-Sánchez}, Discrete Math. 85, No. 1, 99--102 (1990; Zbl 0729.05020) Full Text: DOI
Goldberg, Andrew V.; Tarjan, Robert E. Finding minimum-cost circulations by successive approximation. (English) Zbl 0727.90024 Math. Oper. Res. 15, No. 3, 430-466 (1990). Reviewer: R.E.Burkard (Graz) MSC: 90B10 90C60 90-08 PDFBibTeX XMLCite \textit{A. V. Goldberg} and \textit{R. E. Tarjan}, Math. Oper. Res. 15, No. 3, 430--466 (1990; Zbl 0727.90024) Full Text: DOI
Li, Bing New results on the exponent set of primitive nearly reducible matrices. (English) Zbl 0727.15008 Linear Algebra Appl. 139, 1-19 (1990). MSC: 15A45 05C50 05B20 05C20 PDFBibTeX XMLCite \textit{B. Li}, Linear Algebra Appl. 139, 1--19 (1990; Zbl 0727.15008) Full Text: DOI
Song, Zengmin; Song, Jicheng Paths and number of arcs in digraphs. (Chinese. English summary) Zbl 0726.05039 J. Southeast Univ. 20, No. 1, 91-94 (1990). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{Z. Song} and \textit{J. Song}, J. Southeast Univ. 20, No. 1, 91--94 (1990; Zbl 0726.05039)
Seager, Suzanne M. The double competition number of some triangle-free graphs. (English) Zbl 0723.05063 Discrete Appl. Math. 28, No. 3, 265-269 (1990). Reviewer: G.Chaty (Paris) MSC: 05C20 05C99 PDFBibTeX XMLCite \textit{S. M. Seager}, Discrete Appl. Math. 28, No. 3, 265--269 (1990; Zbl 0723.05063) Full Text: DOI
Masuzawa, Kaori; Mizuno, Shinji; Mori, Masao A polynomial time interior point algorithm for minimum cost flow problems. (English) Zbl 0715.90046 J. Oper. Res. Soc. Japan 33, No. 2, 157-167 (1990). Reviewer: K.G.Murty MSC: 90B10 90C35 90C60 90-08 PDFBibTeX XMLCite \textit{K. Masuzawa} et al., J. Oper. Res. Soc. Japan 33, No. 2, 157--167 (1990; Zbl 0715.90046) Full Text: DOI
André, J. Non-commutative geometry and graphs. (English) Zbl 0715.05034 Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 47-57 (1990). MSC: 05C20 51D15 51D20 PDFBibTeX XML
Brualdi, Richard A.; Liu, Bolian Generalized exponents of primitive directed graphs. (English) Zbl 0714.05028 J. Graph Theory 14, No. 4, 483-499 (1990). Reviewer: G.Chaty MSC: 05C20 05C38 05C50 PDFBibTeX XMLCite \textit{R. A. Brualdi} and \textit{B. Liu}, J. Graph Theory 14, No. 4, 483--499 (1990; Zbl 0714.05028) Full Text: DOI
Hao, Tianbao Existence of graphs with prescribed mean distance and local connectivity. (English) Zbl 0714.05024 Ars Comb. 29, 73-86 (1990). Reviewer: Ján Plesník (Bratislava) MSC: 05C12 05C40 PDFBibTeX XMLCite \textit{T. Hao}, Ars Comb. 29, 73--86 (1990; Zbl 0714.05024)
Toda, Seinosuke On the complexity of topological sorting. (English) Zbl 0713.68025 Inf. Process. Lett. 35, No. 5, 229-233 (1990). Reviewer: T.Walsh MSC: 68Q15 68Q25 68R10 68Q10 PDFBibTeX XMLCite \textit{S. Toda}, Inf. Process. Lett. 35, No. 5, 229--233 (1990; Zbl 0713.68025) Full Text: DOI
Karp, Richard M. The transitive closure of a random digraph. (English) Zbl 0712.68076 Random Struct. Algorithms 1, No. 1, 73-93 (1990). MSC: 68R10 05C80 68Q25 05C20 05C85 PDFBibTeX XMLCite \textit{R. M. Karp}, Random Struct. Algorithms 1, No. 1, 73--93 (1990; Zbl 0712.68076) Full Text: DOI
Amar, Denise; Manoussakis, Yannis Cycles and paths of many lengths in bipartite digraphs. (English) Zbl 0712.05031 J. Comb. Theory, Ser. B 50, No. 2, 254-264 (1990). Reviewer: J.W.Moon MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{D. Amar} and \textit{Y. Manoussakis}, J. Comb. Theory, Ser. B 50, No. 2, 254--264 (1990; Zbl 0712.05031) Full Text: DOI
Harary, Frank; Kabell, Jerald A.; McMorris, F. R. Interval acyclic digraphs. (English) Zbl 0711.05024 Ars Comb. 29A, 59-64 (1990). MSC: 05C20 06A07 PDFBibTeX XMLCite \textit{F. Harary} et al., Ars Comb. 29A, 59--64 (1990; Zbl 0711.05024)
Liu, Liping System isomorphism representation and function analysis. (English) Zbl 0708.05056 Adv. Modelling Simulation 19, No. 4, 17-24 (1990). MSC: 05C90 05C50 PDFBibTeX XML
Fiol, M. A. Connectivity and superconnectivity of large graphs and digraphs. (English) Zbl 0708.05034 Ars Comb. 29B, 5-16 (1990). Reviewer: M.Hager MSC: 05C40 05C20 05C12 PDFBibTeX XMLCite \textit{M. A. Fiol}, Ars Comb. 29B, 5--16 (1990; Zbl 0708.05034)
Fiol, M. A.; Fàbrega, J.; Escudero, M. Short paths and connectivity in graphs and digraphs. (English) Zbl 0708.05025 Ars Comb. 29B, 17-31 (1990). Reviewer: R.C.Entringer MSC: 05C20 05C38 05C40 PDFBibTeX XMLCite \textit{M. A. Fiol} et al., Ars Comb. 29B, 17--31 (1990; Zbl 0708.05025)
Alon, N.; Azar, Y.; Ravid, Y. Universal sequences for complete graphs. (English) Zbl 0707.05032 Discrete Appl. Math. 27, No. 1-2, 25-28 (1990). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{N. Alon} et al., Discrete Appl. Math. 27, No. 1--2, 25--28 (1990; Zbl 0707.05032) Full Text: DOI
Chakroun, N.; Sotteau, D. Chvátal-Erdős theorem for digraphs. (English) Zbl 0707.05029 Cycles and rays: basic structures in finite and infinite graphs, Proc. NATO Adv. Res. Workshop, Montréal/Can. 1987, NATO ASI Ser., Ser. C 301, 75-86 (1990). Reviewer: J.W.Moon MSC: 05C20 05C45 PDFBibTeX XML
Soneoka, Terunao; Nakada, Hiroshi; Imase, Makoto Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. (English) Zbl 0707.05027 Discrete Appl. Math. 27, No. 3, 255-265 (1990). Reviewer: J.W.Moon MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{T. Soneoka} et al., Discrete Appl. Math. 27, No. 3, 255--265 (1990; Zbl 0707.05027) Full Text: DOI
Song, Zengmin Number of arcs and longest cycles in digraphs. (English. Russian original) Zbl 0706.05024 J. Southeast Univ., Engl. Ed. 6, No. 1, 9-12 (1990); translation from J. Southeast Univ. 19, No. 5, 74-80 (1989). MSC: 05C20 05C30 05C38 PDFBibTeX XMLCite \textit{Z. Song}, J. Southeast Univ., Engl. Ed. 6, No. 1, 9--12 (1990; Zbl 0706.05024); translation from J. Southeast Univ. 19, No. 5, 74--80 (1989)
Bang-Jensen, Jørgen Locally semicomplete digraphs: A generalization of tournaments. (English) Zbl 0703.05026 J. Graph Theory 14, No. 3, 371-390 (1990). Reviewer: J.W.Moon MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen}, J. Graph Theory 14, No. 3, 371--390 (1990; Zbl 0703.05026) Full Text: DOI
Tomescu, Ioan Almost all digraphs have a kernel. (English) Zbl 0703.05025 Discrete Math. 84, No. 2, 181-192 (1990). Reviewer: J.W.Moon MSC: 05C20 PDFBibTeX XMLCite \textit{I. Tomescu}, Discrete Math. 84, No. 2, 181--192 (1990; Zbl 0703.05025) Full Text: DOI
Cooper, C.; Frieze, A. M. The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected. (English) Zbl 0702.05073 J. Comb. Theory, Ser. B 48, No. 1, 117-134 (1990). Reviewer: N.Ranganathan MSC: 05C80 05C20 05C40 PDFBibTeX XMLCite \textit{C. Cooper} and \textit{A. M. Frieze}, J. Comb. Theory, Ser. B 48, No. 1, 117--134 (1990; Zbl 0702.05073) Full Text: DOI
Cai, Mao-cheng Restricted covering of digraphs with arborescences. (English) Zbl 0701.05022 Discrete Math. 82, No. 2, 143-152 (1990). Reviewer: G.Chaty MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{M.-c. Cai}, Discrete Math. 82, No. 2, 143--152 (1990; Zbl 0701.05022) Full Text: DOI
Hefner, Kim A. S. Biclique covers and partitions of digraphs: A set theoretic approach. (English) Zbl 0701.05021 Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 74, 173-179 (1990). Reviewer: G.Chaty MSC: 05C20 05C70 05C50 PDFBibTeX XML
Chen, Y. L.; Chin, Y. H. The quickest path problem. (English) Zbl 0698.90083 Comput. Oper. Res. 17, No. 2, 153-161 (1990). Reviewer: R.E.Burkard MSC: 90C35 90C27 68Q25 PDFBibTeX XMLCite \textit{Y. L. Chen} and \textit{Y. H. Chin}, Comput. Oper. Res. 17, No. 2, 153--161 (1990; Zbl 0698.90083) Full Text: DOI
Kim, Suh-Ryung; Roberts, Fred S. On Opsut’s conjecture about the competition number. (English) Zbl 0697.05031 Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 71, 173-176 (1990). Reviewer: J.W.Moon MSC: 05C20 PDFBibTeX XML
Ceré, Attilia Errata: Regular imbeddings of coloured digraphs. (English) Zbl 0695.05017 Geom. Dedicata 33, No. 2, 239 (1990). MSC: 05C10 05C15 05C20 PDFBibTeX XMLCite \textit{A. Ceré}, Geom. Dedicata 33, No. 2, 239 (1990; Zbl 0695.05017) Full Text: DOI
Gargano, Michael; Kennedy, John W.; Quintas, Louis V. Irregular digraphs. (English) Zbl 0693.05038 Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 72, 223-231 (1990). Reviewer: Wai-Kai Chen MSC: 05C20 05C40 PDFBibTeX XML
Iyer, Hari; Manvel, Bennet; Osborne, Richard Digraphs with constant walk numbers. (English) Zbl 0693.05037 Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 74, 155-162 (1990). Reviewer: Wai-Kai Chen MSC: 05C20 05C38 PDFBibTeX XML
Li, Jiongsheng; Huang, Daode; Pan, Qun Digraphs with degree equivalent induced subdigraphs. (English) Zbl 0663.05030 J. Comb. Theory, Ser. B 50, No. 2, 288-298 (1990). Reviewer: Li Jiongsheng MSC: 05C20 PDFBibTeX XMLCite \textit{J. Li} et al., J. Comb. Theory, Ser. B 50, No. 2, 288--298 (1990; Zbl 0663.05030) Full Text: DOI
Simon, Klaus Finding a minimal transitive reduction in a strongly connected digraph within linear time. (English) Zbl 0768.68180 Graph-theoretic concepts in computer science, Proc. 15th Int. Workshop, WG ’89, Castle Rolduc/Neth. 1989, Lect. Notes Comput. Sci. 411, 245-259 (1990). MSC: 68R10 05C20 68Q25 05C05 PDFBibTeX XMLCite \textit{K. Simon}, Lect. Notes Comput. Sci. 411, 245--259 (1990; Zbl 0768.68180)
Speckenmeyer, Ewald On feedback problems in digraphs. (English) Zbl 0768.68181 Graph-theoretic concepts in computer science, Proc. 15th Int. Workshop, WG ’89, Castle Rolduc/Neth. 1989, Lect. Notes Comput. Sci. 411, 218-231 (1990). MSC: 68R10 68Q25 05C20 60G50 PDFBibTeX XMLCite \textit{E. Speckenmeyer}, Lect. Notes Comput. Sci. 411, 218--231 (1990; Zbl 0768.68181)
Fleischner, H.; Jackson, B. Compatible Euler tours in Eulerian digraphs. (English) Zbl 0743.05036 Cycles and rays: basic structures in finite and infinite graphs, Proc. NATO Adv. Res. Workshop, Montréal/Can. 1987, NATO ASI Ser., Ser. C 301, 95-100 (1990). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{H. Fleischner} and \textit{B. Jackson}, in: An order- and graph-theoretical characterisation of weakly compact cardinals. . 95--100 (1990; Zbl 0743.05036)