Karzanov, A. V. Minimal mean weight cuts and cycles in directed graphs. (English. Russian original) Zbl 0806.05034 Transl., Ser. 2, Am. Math. Soc. 158, 47-55 (1994); translation from Klimov, V. S. (ed.), Qualitative and approximate methods in the study of operator equations, Yaroslavl’, 72-83 (1985). Reviewer: G.Chaty (Paris) MSC: 05C20 05C38 90B10 PDFBibTeX XMLCite \textit{A. V. Karzanov}, Transl., Ser. 2, Am. Math. Soc. 158, 47--55 (1985; Zbl 0806.05034); translation from Klimov, V. S. (ed.), Qualitative and approximate methods in the study of operator equations, Yaroslavl', 72--83 (1985)
Jones, Kathryn F.; Lundgren, J. Richard; Maybee, John S. Clique covers of digraphs. II. (English) Zbl 0677.05037 Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fla. 1985, Congr. Numerantium 48, 211-218 (1985). MSC: 05C20 05C35 05C70 PDFBibTeX XML
Chen, Rongsi A theorem on automorphism groups of graphs and digraphs. (English) Zbl 0651.05039 J. Xinjiang Univ., Nat. Sci. 1985, No. 3, 56-62 (1985). Reviewer: St.Althoen MSC: 05C25 05C20 05C50 PDFBibTeX XMLCite \textit{R. Chen}, J. Xinjiang Univ., Nat. Sci. 1985, No. 3, 56--62 (1985; Zbl 0651.05039)
Marcu, Dănuţ On the paths of a digraph without circuits. (English) Zbl 0619.05025 Gaz. Mat., Perfecţ. Metod. Metodol. Mat. Inf. 6, 93-94 (1985). Reviewer: C.Chaty MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{D. Marcu}, Gaz. Mat., Perfecț. Metod. Metodol. Mat. Inf. 6, 93--94 (1985; Zbl 0619.05025)
Brudaru, O. A parallel algorithm for a variant of the acyclic partition problem. (English) Zbl 0615.68046 Graphen und Netzwerke - Theorie und Anwendungen, 30. int. wiss. Kolloq., Ilmenau 1985, Heft 5, 29-32 (1985). MSC: 68R10 05C70 05C20 PDFBibTeX XML
Darbinyan, S. Kh. Pancyclicity of digraphs under the Meyniel condition. (Russian. English summary) Zbl 0614.05025 Stud. Sci. Math. Hung. 20, 95-117 (1985). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{S. Kh. Darbinyan}, Stud. Sci. Math. Hung. 20, 95--117 (1985; Zbl 0614.05025)
Kyš, Peter; Wawruch, Alojz Maximal sizes of planar digraphs without transitive edges. (English) Zbl 0613.05026 Acta Math. Univ. Comenianae 46-47, 243-249 (1985). Reviewer: G.Chaty MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{P. Kyš} and \textit{A. Wawruch}, Acta Math. Univ. Comenianae 46--47, 243--249 (1985; Zbl 0613.05026)
Schirmer, Helga A topologist’s view of Sharkovsky’s theorem. (English) Zbl 0606.54031 Houston J. Math. 11, 385-395 (1985). MSC: 54H20 54F05 54F15 PDFBibTeX XMLCite \textit{H. Schirmer}, Houston J. Math. 11, 385--395 (1985; Zbl 0606.54031)
Reinschke, K. Graphentheoretische Berechnung von charakteristischen Polynomen in mehreren Variablen. (German) Zbl 0599.05045 Graphen und Netzwerke - Theorie und Anwendungen, 30. int. wiss. Kolloq., Ilmenau 1985, Heft 5, 85-88 (1985). MSC: 05C50 05C20 01A55 PDFBibTeX XML
Kovalev, A. A.; Malyshko, V. V. Experimental investigation of the laboriousness of algorithms for establishing a digraph isomorphism. (English) Zbl 0595.05068 Vestn. Beloruss. Gos. Univ. Im. V. I. Lenina, Ser. I 1985, No. 1, 57-61 (1985). MSC: 05C99 05C20 68R10 PDFBibTeX XMLCite \textit{A. A. Kovalev} and \textit{V. V. Malyshko}, Vestn. Beloruss. Gos. Univ. Im. V. I. Lenina, Ser. I 1985, No. 1, 57--61 (1985; Zbl 0595.05068)
May, M. Über längste Wege in Digraphen. (On longest paths in digraphs). (German) Zbl 0591.05042 Graphen und Netzwerke - Theorie und Anwendungen, 30. int. wiss. Kolloq., Ilmenau 1985, Heft 5, 77-80 (1985). MSC: 05C38 05C35 05C20 68R10 PDFBibTeX XML
Bidamon, E.; Meyniel, H. On the Shannon capacity of a directed graph. (English) Zbl 0591.05034 Eur. J. Comb. 6, 289-290 (1985). Reviewer: P.Horák MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{E. Bidamon} and \textit{H. Meyniel}, Eur. J. Comb. 6, 289--290 (1985; Zbl 0591.05034) Full Text: DOI
Marcu, D. On finding the Eulerian paths and circuits of a digraph. (English) Zbl 0589.05037 Bul. Inst. Politeh. Bucur., Ser. Autom. Calc. 46/47(1984/1985), 143-147 (1985). MSC: 05C20 05C45 68R10 05-04 PDFBibTeX XMLCite \textit{D. Marcu}, Bul. Inst. Politeh. Bucur., Ser. Autom. Calc. 46/47, 143--147 (1985; Zbl 0589.05037)
Benhocine, A.; Wojda, A. P. On self-complementation. (English) Zbl 0587.05054 J. Graph Theory 9, No. 3, 335-341 (1985). Reviewer: R. C. Read MSC: 05C75 PDFBibTeX XMLCite \textit{A. Benhocine} and \textit{A. P. Wojda}, J. Graph Theory 9, No. 3, 335--341 (1985; Zbl 0587.05054) Full Text: DOI Link
Jackson, Bill; Ordaz, Oscar A Chvátal-Erdős condition for (1,1)-factors in digraphs. (English) Zbl 0586.05020 Discrete Math. 57, 199-201 (1985). Reviewer: G.Chaty MSC: 05C20 05C38 05C45 05C70 PDFBibTeX XMLCite \textit{B. Jackson} and \textit{O. Ordaz}, Discrete Math. 57, 199--201 (1985; Zbl 0586.05020) Full Text: DOI
Harary, Frank; Lundgren, J. Richard; Maybee, John S. On signed digraphs with all cycles negative. (English) Zbl 0586.05019 Discrete Appl. Math. 12, 155-164 (1985). Reviewer: G.Chaty MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{F. Harary} et al., Discrete Appl. Math. 12, 155--164 (1985; Zbl 0586.05019) Full Text: DOI
Agrawal, Avinash; Satyanarayana, A. Network reliability analysis using 2-connected digraph reductions. (English) Zbl 0585.90040 Networks 15, 239-256 (1985). MSC: 90B25 90B10 60K10 PDFBibTeX XMLCite \textit{A. Agrawal} and \textit{A. Satyanarayana}, Networks 15, 239--256 (1985; Zbl 0585.90040) Full Text: DOI
Ivanchev, D. T. Establishment of foremost nodes in a network. (English) Zbl 0584.94028 C. R. Acad. Bulg. Sci. 38, 1469-1472 (1985). Reviewer: W.-K.Chen MSC: 94C15 05C20 94C05 90B10 PDFBibTeX XMLCite \textit{D. T. Ivanchev}, C. R. Acad. Bulg. Sci. 38, 1469--1472 (1985; Zbl 0584.94028)
Babai, L. Arc transitive covering digraphs and their eigenvalues. (English) Zbl 0583.05030 J. Graph Theory 9, No. 3, 363-370 (1985). Reviewer: S.Althoen MSC: 05C20 05C25 05C50 PDFBibTeX XMLCite \textit{L. Babai}, J. Graph Theory 9, No. 3, 363--370 (1985; Zbl 0583.05030) Full Text: DOI
Szwarcfiter, Jayme L. On digraphs with a rooted tree structure. (English) Zbl 0582.05030 Networks 15, 49-57 (1985). Reviewer: G.Chaty MSC: 05C20 68R10 05C05 68P10 PDFBibTeX XMLCite \textit{J. L. Szwarcfiter}, Networks 15, 49--57 (1985; Zbl 0582.05030) Full Text: DOI Link
Chung, F. R. K.; Graham, R. L.; Winkler, P. M. On the addressing problem for directed graphs. (English) Zbl 0581.05030 Graphs Comb. 1, 41-50 (1985). Reviewer: G.Chaty MSC: 05C20 15A23 94C15 PDFBibTeX XMLCite \textit{F. R. K. Chung} et al., Graphs Comb. 1, 41--50 (1985; Zbl 0581.05030) Full Text: DOI
Andrei, Neculai Sparse systems. Digraph approach of large-scale linear systems theory. (English) Zbl 0579.93004 Interdisciplinary Systems Research, 90. Köln: Verlag TÜV Rheinland. VIII, 254 p. DM 72.00 (1985). Reviewer: L.Bakule MSC: 93A15 93-01 93C05 05C20 15B57 93B05 93B20 93B50 93C99 93B55 PDFBibTeX XML
Sacks, Ivan J. Digraph matrix analysis. (English) Zbl 0578.90030 IEEE Trans. Reliab. 34, 437-446 (1985). MSC: 90B25 PDFBibTeX XMLCite \textit{I. J. Sacks}, IEEE Trans. Reliab. 34, 437--446 (1985; Zbl 0578.90030) Full Text: DOI
Mader, W. Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs). (German) Zbl 0578.05045 J. Comb. Theory, Ser. B 38, 102-117 (1985). Reviewer: M.Hager MSC: 05C40 05C20 05C35 PDFBibTeX XMLCite \textit{W. Mader}, J. Comb. Theory, Ser. B 38, 102--117 (1985; Zbl 0578.05045) Full Text: DOI
Meyniel, H. A note about a theorem by Maamoun on decompositions of digraphs into elementary directed paths or cycles. (English) Zbl 0578.05028 J. Comb. Theory, Ser. B 39, 368-370 (1985). Reviewer: Wai-Kai Chen MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{H. Meyniel}, J. Comb. Theory, Ser. B 39, 368--370 (1985; Zbl 0578.05028) Full Text: DOI
Marcu, Dănuţ On finding the elementary paths of a digraph. (English) Zbl 0577.05046 Math., Rev. Anal. Numér. Théor. Approximation, Anal. Numér. Théor. Approximation 14, 117-121 (1985). MSC: 05C38 05C20 05-04 68R10 PDFBibTeX XMLCite \textit{D. Marcu}, Math. Rev. Anal. Numér. Théor. Approximation, Anal. Numér. Théor. Approximation 14, 117--121 (1985; Zbl 0577.05046)
Grötschel, Martin; Jünger, Michael; Reinelt, Gerhard Facets of the linear ordering polytope. (English) Zbl 0577.05035 Math. Program. 33, 43-60 (1985). MSC: 05C20 52Bxx 90C10 PDFBibTeX XMLCite \textit{M. Grötschel} et al., Math. Program. 33, 43--60 (1985; Zbl 0577.05035) Full Text: DOI
Grötschel, Martin; Jünger, Michael; Reinelt, Gerhard On the acyclic subgraph polytope. (English) Zbl 0577.05034 Math. Program. 33, 28-42 (1985). MSC: 05C20 52Bxx 90C10 05C38 PDFBibTeX XMLCite \textit{M. Grötschel} et al., Math. Program. 33, 28--42 (1985; Zbl 0577.05034) Full Text: DOI
Wiener, Gerry Some results concerning invertible Morishima and anti-Morishima matrices whose associated digraphs are trees. (English) Zbl 0576.05048 Linear Algebra Appl. 66, 199-219 (1985). Reviewer: V.Fleischer MSC: 05C50 05C20 05C05 PDFBibTeX XMLCite \textit{G. Wiener}, Linear Algebra Appl. 66, 199--219 (1985; Zbl 0576.05048) Full Text: DOI
Mader, W. Degree and local connectivity in digraphs. (English) Zbl 0576.05044 Combinatorica 5, 161-165 (1985). Reviewer: M.C.Heydemann MSC: 05C40 05C20 05C38 PDFBibTeX XMLCite \textit{W. Mader}, Combinatorica 5, 161--165 (1985; Zbl 0576.05044) Full Text: DOI
Marcu, Dănuţ Note on the regular digraphs. (English) Zbl 0575.05033 Rend. Sem. Mat. Univ. Padova 73, 95-98 (1985). Reviewer: G.Chaty MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{D. Marcu}, Rend. Semin. Mat. Univ. Padova 73, 95--98 (1985; Zbl 0575.05033) Full Text: Numdam EuDML
Keating, Kevin Multiple-ply Hamiltonian graphs and digraphs. (English) Zbl 0573.05028 Cycles in graphs, Workshop Simon Fraser Univ., Burnaby/Can. 1982, Ann. Discrete Math. 27, 81-87 (1985). Reviewer: C.Thomassen MSC: 05C20 05C25 05C38 05C45 PDFBibTeX XML
Kano, Mikio; Sakamoto, Akio Ranking the vertices of a paired comparison digraph. (English) Zbl 0572.05030 SIAM J. Algebraic Discrete Methods 6, 79-92 (1985). Reviewer: G.Schmidt MSC: 05C20 05C35 68Q25 90B50 PDFBibTeX XMLCite \textit{M. Kano} and \textit{A. Sakamoto}, SIAM J. Algebraic Discrete Methods 6, 79--92 (1985; Zbl 0572.05030) Full Text: DOI
Gaul, W.; Hartung, J. Multistate reliability problems for gsp-digraphs. (English) Zbl 0571.90027 Contributions to operations research, Proc. Conf., Oberwolfach/Ger. 1984, Lect. Notes Econ. Math. Syst. 240, 41-53 (1985). MSC: 90B25 62N05 PDFBibTeX XML
Heydemann, M. C. Minimum number of circuits covering the vertices of a strong digraph. (English) Zbl 0571.05031 Cycles in graphs, Workshop Simon Fraser Univ., Burnaby/Can. 1982, Ann. Discrete Math. 27, 287-296 (1985). Reviewer: W.-K.Chen MSC: 05C38 05C20 05C35 PDFBibTeX XML
Marušič, D. Vertex transitive graphs and digraphs of order \(p^ k\). (English) Zbl 0571.05024 Cycles in graphs, Workshop Simon Fraser Univ., Burnaby/Can. 1982, Ann. Discrete Math. 27, 115-128 (1985). Reviewer: W.-K.Chen MSC: 05C25 05C20 PDFBibTeX XML
Bloom, G. S.; Hsu, D. F. On graceful directed graphs that are computational models of some algebraic systems. (English) Zbl 0571.05022 Graph theory with applications to algorithms and computer science, Proc. 5th Int. Conf., Kalamazoo/Mich. 1984, 89-102 (1985). Reviewer: P.Avery MSC: 05C20 05C25 05B05 05B10 05B15 PDFBibTeX XML
Jungreis, Irwin L. Infinite Hamiltonian paths in Cayley digraphs. (English) Zbl 0569.05037 Discrete Math. 54, 167-180 (1985). Reviewer: S.F.Kapoor MSC: 05C38 05C45 05C25 05C20 PDFBibTeX XMLCite \textit{I. L. Jungreis}, Discrete Math. 54, 167--180 (1985; Zbl 0569.05037) Full Text: DOI
Aharoni, R.; Hartman, I. Ben-Arroyo; Hoffman, A. J. Path partitions and packs of acyclic digraphs. (English) Zbl 0569.05024 Pac. J. Math. 118, 249-259 (1985). Reviewer: P.Horák MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{R. Aharoni} et al., Pac. J. Math. 118, 249--259 (1985; Zbl 0569.05024) Full Text: DOI Euclid
Rohnert, Hans A dynamization of the all pairs least cost path problem. (English) Zbl 0568.68050 Theoretical aspects of computer science, 2nd ann. Symp., Saarbrücken/Ger. 1985, Lect. Notes Comput. Sci. 182, 279-286 (1985). MSC: 68R10 68P05 68Q25 PDFBibTeX XML
Berge, Claude Path-partitions in directed graphs and posets. (English) Zbl 0565.05030 Graphs and order. The role of graphs in the theory of ordered sets and its applications, Proc. NATO Adv. Study Inst., Banff/Can. 1984, NATO ASI Ser., Ser. C 147, 447-464 (1985). Reviewer: P.Avery MSC: 05C20 05C38 06A06 PDFBibTeX XML
Jajodia, Sushil On equivalence of relational and network database models. (English) Zbl 0564.68068 Inf. Process. Lett. 20, 51-54 (1985). Reviewer: J.Pokorný MSC: 68P20 68P05 PDFBibTeX XMLCite \textit{S. Jajodia}, Inf. Process. Lett. 20, 51--54 (1985; Zbl 0564.68068) Full Text: DOI
Shao, Jiayu On a conjecture about the exponent set of primitive matrices. (English) Zbl 0564.15004 Linear Algebra Appl. 65, 91-123 (1985). Reviewer: H.-J.Kowalsky MSC: 15A15 05C50 15B48 PDFBibTeX XMLCite \textit{J. Shao}, Linear Algebra Appl. 65, 91--123 (1985; Zbl 0564.15004) Full Text: DOI
Thomassen, Carsten The 2-linkage problem for acyclic digraphs. (English) Zbl 0563.05027 Discrete Math. 55, 73-87 (1985). Reviewer: W.-K.Chen MSC: 05C20 05C38 05C10 PDFBibTeX XMLCite \textit{C. Thomassen}, Discrete Math. 55, 73--87 (1985; Zbl 0563.05027) Full Text: DOI
Szwarcfiter, Jayme L.; Persiano, Ronaldo C. M.; Oliveira, Antonio A. F. Orientations with single source and sink. (English) Zbl 0563.05026 Discrete Appl. Math. 10, 313-321 (1985). Reviewer: W.-K.Chen MSC: 05C20 05C30 05C99 PDFBibTeX XMLCite \textit{J. L. Szwarcfiter} et al., Discrete Appl. Math. 10, 313--321 (1985; Zbl 0563.05026) Full Text: DOI
Lundgren, J. Richard; Maybee, John S. Food webs with interval competition graph. (English) Zbl 0558.05022 Graphs and applications, Proc. 1st Symp. Graph theory, Boulder/Colo. 1982, 245-256 (1985). Reviewer: L.Niepel MSC: 05C20 PDFBibTeX XML
Imase, Makoto; Soneoka, Terunao; Okada, Keiji Connectivity of regular directed graphs with small diameters. (English) Zbl 0554.05044 IEEE Trans. Comput. 34, 267-273 (1985). Reviewer: P.Avery MSC: 05C40 05C20 94C15 05C38 PDFBibTeX XMLCite \textit{M. Imase} et al., IEEE Trans. Comput. 34, 267--273 (1985; Zbl 0554.05044) Full Text: DOI
Krishnamurthy, Balakrishnan Short proofs for tricky formulas. (English) Zbl 0552.03009 Acta Inf. 22, 253-275 (1985). MSC: 03B35 PDFBibTeX XMLCite \textit{B. Krishnamurthy}, Acta Inf. 22, 253--275 (1985; Zbl 0552.03009) Full Text: DOI