Mertzios, George B.; Michail, Othon; Spirakis, Paul G. Temporal network optimization subject to connectivity constraints. (English) Zbl 1421.68139 Algorithmica 81, No. 4, 1416-1449 (2019). MSC: 68R10 05C12 05C40 05C78 68Q17 68W25 90C35 PDF BibTeX XML Cite \textit{G. B. Mertzios} et al., Algorithmica 81, No. 4, 1416--1449 (2019; Zbl 1421.68139) Full Text: DOI
Leaños, J.; Trujillo-Negrete, A. L. The connectivity of token graphs. (English) Zbl 1395.05096 Graphs Comb. 34, No. 4, 777-790 (2018). MSC: 05C40 PDF BibTeX XML Cite \textit{J. Leaños} and \textit{A. L. Trujillo-Negrete}, Graphs Comb. 34, No. 4, 777--790 (2018; Zbl 1395.05096) Full Text: DOI
Carmesin, Johannes Topological infinite gammoids, and a new Menger-type theorem for infinite graphs. (English) Zbl 1395.05117 Electron. J. Comb. 25, No. 3, Research Paper P3.38, 22 p. (2018). MSC: 05C63 PDF BibTeX XML Cite \textit{J. Carmesin}, Electron. J. Comb. 25, No. 3, Research Paper P3.38, 22 p. (2018; Zbl 1395.05117) Full Text: Link arXiv
Cornaz, Denis; Magnouche, Youcef The minimum rooted-cycle cover problem. (English) Zbl 1404.90109 Lee, Jon (ed.) et al., Combinatorial optimization. 5th international symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018. Revised selected papers. Cham: Springer (ISBN 978-3-319-96150-7/pbk; 978-3-319-96151-4/ebook). Lecture Notes in Computer Science 10856, 115-120 (2018). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{D. Cornaz} and \textit{Y. Magnouche}, Lect. Notes Comput. Sci. 10856, 115--120 (2018; Zbl 1404.90109) Full Text: DOI
Joó, Attila Countable Menger’s theorem with finitary matroid constraints on the ingoing edges. (English) Zbl 1393.05134 Electron. J. Comb. 25, No. 3, Research Paper P3.12, 10 p. (2018). MSC: 05C20 05C38 05C40 05B35 05C63 05C30 PDF BibTeX XML Cite \textit{A. Joó}, Electron. J. Comb. 25, No. 3, Research Paper P3.12, 10 p. (2018; Zbl 1393.05134) Full Text: Link
Vassena, Nicola; Matano, Hiroshi Monomolecular reaction networks: flux-influenced sets and balloons. (English) Zbl 1383.92034 Math. Methods Appl. Sci. 40, No. 18, 7722-7736 (2017). MSC: 92C42 92C40 PDF BibTeX XML Cite \textit{N. Vassena} and \textit{H. Matano}, Math. Methods Appl. Sci. 40, No. 18, 7722--7736 (2017; Zbl 1383.92034) Full Text: DOI
Jamison, Robert E.; Mulder, Henry Martyn Graphs constructible from cycles and complete graphs. (English) Zbl 1365.05152 Discrete Math. 340, No. 9, 2301-2306 (2017). MSC: 05C38 05C69 PDF BibTeX XML Cite \textit{R. E. Jamison} and \textit{H. M. Mulder}, Discrete Math. 340, No. 9, 2301--2306 (2017; Zbl 1365.05152) Full Text: DOI
Dutle, Aaron; Kay, Bill Graph odometry. (English) Zbl 1346.05100 Discrete Appl. Math. 214, 108-115 (2016). MSC: 05C22 05C60 PDF BibTeX XML Cite \textit{A. Dutle} and \textit{B. Kay}, Discrete Appl. Math. 214, 108--115 (2016; Zbl 1346.05100) Full Text: DOI arXiv
Xu, Easton Li; Han, Guangyue The minimum number of hubs in networks. (English) Zbl 1355.90102 J. Comb. Optim. 30, No. 4, 1196-1218 (2015). MSC: 90C35 PDF BibTeX XML Cite \textit{E. L. Xu} and \textit{G. Han}, J. Comb. Optim. 30, No. 4, 1196--1218 (2015; Zbl 1355.90102) Full Text: DOI arXiv
Kao, Shin-Shin; Huang, Hua-Min; Hsu, Kung-Ming; Hsu, Lih-Hsing Cubic 1-fault-tolerant Hamiltonian graphs, globally \(3^\ast \)-connected graphs, and super 3-spanning connected graphs. (English) Zbl 1313.05216 Ars Comb. 110, 301-322 (2013). MSC: 05C45 05C40 PDF BibTeX XML Cite \textit{S.-S. Kao} et al., Ars Comb. 110, 301--322 (2013; Zbl 1313.05216)
Towsner, Henry Partial impredicativity in reverse mathematics. (English) Zbl 1275.03079 J. Symb. Log. 78, No. 2, 459-488 (2013). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03F35 PDF BibTeX XML Cite \textit{H. Towsner}, J. Symb. Log. 78, No. 2, 459--488 (2013; Zbl 1275.03079) Full Text: DOI Euclid arXiv
Lee, Jae-Ha; Park, Jung-Heum General-demand disjoint path covers in a graph with faulty elements. (English) Zbl 1257.05073 Int. J. Comput. Math. 89, No. 5, 606-617 (2012). MSC: 05C38 05C40 05C45 05C65 68R10 90B18 PDF BibTeX XML Cite \textit{J.-H. Lee} and \textit{J.-H. Park}, Int. J. Comput. Math. 89, No. 5, 606--617 (2012; Zbl 1257.05073) Full Text: DOI
Kao, Shin-Shin; Hsu, Hong-Chun; Hsu, Lih-Hsing Globally bi-3*-connected graphs. (English) Zbl 1184.05076 Discrete Math. 309, No. 8, 1931-1946 (2009). MSC: 05C40 05C45 PDF BibTeX XML Cite \textit{S.-S. Kao} et al., Discrete Math. 309, No. 8, 1931--1946 (2009; Zbl 1184.05076) Full Text: DOI
Sorkin, Gregory B.; Steger, Angelika; Zenklusen, Rico A tight bound on the collection of edges in MSTs of induced subgraphs. (English) Zbl 1229.05156 J. Comb. Theory, Ser. B 99, No. 2, 428-435 (2009). MSC: 05C35 05C05 05C40 PDF BibTeX XML Cite \textit{G. B. Sorkin} et al., J. Comb. Theory, Ser. B 99, No. 2, 428--435 (2009; Zbl 1229.05156) Full Text: DOI arXiv
Thomassen, Carsten; Vella, Antoine Graph-like continua, augmenting arcs, and Menger’s theorem. (English) Zbl 1175.05045 Combinatorica 28, No. 5, 595-623 (2008). Reviewer: Maria Rita Casali (Modena) MSC: 05C10 57M15 54D30 PDF BibTeX XML Cite \textit{C. Thomassen} and \textit{A. Vella}, Combinatorica 28, No. 5, 595--623 (2008; Zbl 1175.05045) Full Text: DOI
Seymour, P. D. Disjoint paths in graphs. (Reprint). (English) Zbl 1099.05048 Discrete Math. 306, No. 10-11, 979-991 (2006). Reviewer: Ralph Faudree (Memphis) MSC: 05C38 PDF BibTeX XML Cite \textit{P. D. Seymour}, Discrete Math. 306, No. 10--11, 979--991 (2006; Zbl 1099.05048) Full Text: DOI
Clurcelle, Bruno Introduction to graph theory: definitions, applications, and proof techniques. (Introduction à la théorie des graphes: définitions, applications et techniques de preuves.) (French) Zbl 1109.05002 Berline, Nicole (ed.) et al., Graphs. Mathematics colloquium X-UPS, Palaisau, France, May 17–18, 2004. Palaiseau: Les Éditions de l’École Polytechnique (ISBN 2-7302-1182-9/pbk). 1-23 (2004). Reviewer: J. L. Ramirez Alfonsin (Paris) MSC: 05-01 PDF BibTeX XML Cite \textit{B. Clurcelle}, in: Graphes. Journées mathématiques X-UPS, 2004. Palaiseau: Les Éditions de l'École Polytechnique. 1--23 (2004; Zbl 1109.05002)
Diestel, Reinhard The countable Erdős-Menger conjecture with ends. (English) Zbl 1021.05063 J. Comb. Theory, Ser. B 87, No. 1, 145-161 (2003). Reviewer: Jun-Ming Xu (Hefei) MSC: 05C40 PDF BibTeX XML Cite \textit{R. Diestel}, J. Comb. Theory, Ser. B 87, No. 1, 145--161 (2003; Zbl 1021.05063) Full Text: DOI
Fukuyama, Masahiko A Nim game played on graphs. (English) Zbl 1041.91018 Theor. Comput. Sci. 304, No. 1-3, 387-399 (2003). MSC: 91A43 91A18 68R10 PDF BibTeX XML Cite \textit{M. Fukuyama}, Theor. Comput. Sci. 304, No. 1--3, 387--399 (2003; Zbl 1041.91018) Full Text: DOI
Böhme, T.; Göring, F.; Harant, J. Menger’s theorem. (English) Zbl 0988.05057 J. Graph Theory 37, No. 1, 35-36 (2001). MSC: 05C40 05C20 05C38 PDF BibTeX XML Cite \textit{T. Böhme} et al., J. Graph Theory 37, No. 1, 35--36 (2001; Zbl 0988.05057) Full Text: DOI
Godsil, Chris; Royle, Gordon Algebraic graph theory. (English) Zbl 0968.05002 Graduate Texts in Mathematics. 207. New York, NY: Springer. xix, 439 p. (2001). Reviewer: J.H.van Lint (Eindhoven) MSC: 05-02 05Cxx 05Exx PDF BibTeX XML Cite \textit{C. Godsil} and \textit{G. Royle}, Algebraic graph theory. New York, NY: Springer (2001; Zbl 0968.05002)
Hochstättler, Winfried; Nešetřil, Jaroslav A note on maxflow-mincut and homomorphic equivalence in matroids. (English) Zbl 0966.05015 J. Algebr. Comb. 12, No. 3, 295-300 (2000). MSC: 05B35 PDF BibTeX XML Cite \textit{W. Hochstättler} and \textit{J. Nešetřil}, J. Algebr. Comb. 12, No. 3, 295--300 (2000; Zbl 0966.05015) Full Text: DOI
Giesen, J. Curve reconstruction, the Traveling Salesman Problem, and Menger’s theorem on length. (English) Zbl 0984.65012 Discrete Comput. Geom. 24, No. 4, 577-603 (2000). Reviewer: M.Hager (Leonberg) MSC: 65D18 90C27 90C35 PDF BibTeX XML Cite \textit{J. Giesen}, Discrete Comput. Geom. 24, No. 4, 577--603 (2000; Zbl 0984.65012) Full Text: DOI
Shahrokhi, Farhad; Sýkora, Ondrej; Székely, László A.; Vrto, Imrich A new lower bound for the bipartite crossing number with applications. (English) Zbl 0946.68102 Theor. Comput. Sci. 245, No. 2, 281-294 (2000). MSC: 68R10 68W35 PDF BibTeX XML Cite \textit{F. Shahrokhi} et al., Theor. Comput. Sci. 245, No. 2, 281--294 (2000; Zbl 0946.68102) Full Text: DOI
Boza, L.; Diánez, A.; Márquez, A.; Quintero, A. A link between Menger’s theorem and infinite Euler graphs. (English) Zbl 0924.05046 Acta Math. Hung. 74, No. 1-2, 41-46 (1997). MSC: 05C45 PDF BibTeX XML Cite \textit{L. Boza} et al., Acta Math. Hung. 74, No. 1--2, 41--46 (1997; Zbl 0924.05046) Full Text: DOI
Su, Xiang-Ying Some generalizations of Menger’s theorem concerning arc-connected digraphs. (English) Zbl 0890.05043 Discrete Math. 175, No. 1-3, 293-296 (1997). Reviewer: F.Gliviak (Bratislava) MSC: 05C40 05C20 PDF BibTeX XML Cite \textit{X.-Y. Su}, Discrete Math. 175, No. 1--3, 293--296 (1997; Zbl 0890.05043) Full Text: DOI
Aharoni, Ron A few remarks on a conjecture of Erdös on the infinite version of Menger’s theorem. (English) Zbl 0870.05043 Graham, Ronald L. (ed.) et al., The mathematics of Paul Erdős. Vol. II. Berlin: Springer. Algorithms Comb. 14, 394-408 (1997). Reviewer: M.Hager (Leonberg) MSC: 05C40 05C38 05C35 PDF BibTeX XML Cite \textit{R. Aharoni}, Algorithms Comb. 14, 394--408 (1997; Zbl 0870.05043)
Hind, H. R.; Oellermann, O. Menger-type results for three or more vertices. (English) Zbl 0974.05047 Congr. Numerantium 113, 179-204 (1996). MSC: 05C40 05C35 PDF BibTeX XML Cite \textit{H. R. Hind} and \textit{O. Oellermann}, Congr. Numerantium 113, 179--204 (1996; Zbl 0974.05047)
Volkmann, Lutz Fundaments of graph theory. (Fundamente der Graphentheorie.) (German) Zbl 0844.05001 Wien: Springer-Verlag. xix, 446 S. (1996). Reviewer: O.R.Oellermann (Killarney) MSC: 05-01 05Cxx PDF BibTeX XML Cite \textit{L. Volkmann}, Fundamente der Graphentheorie. Wien: Springer-Verlag (1996; Zbl 0844.05001)
Frank, András Connectivity and network flows. (English) Zbl 0846.05055 Graham, R. L. (ed.) et al., Handbook of combinatorics. Vol. 1-2. Amsterdam: Elsevier (North-Holland). 111-177 (1995). Reviewer: A.Huck (Hannover) MSC: 05C40 05C85 90C10 PDF BibTeX XML Cite \textit{A. Frank}, in: Handbook of combinatorics. Vol. 1-2. Amsterdam: Elsevier (North-Holland); Cambridge, MA: MIT Press. 111--177 (1995; Zbl 0846.05055)
Schrijver, Alexander Rambling along paths, trees, flows, curves, knots, and rails. (English) Zbl 0851.57011 Apt, Krzysztof (ed.) et al., From universal morphisms to megabytes: a Baayen space Odyssey. On the occasion of the retirement of Prof. Dr. P. C. Baayen. Amsterdam: CWI, 493-534 (1995). Reviewer: L.Traldi (Easton) MSC: 57M25 05C10 90B06 PDF BibTeX XML Cite \textit{A. Schrijver}, in: From universal morphisms to megabytes: a Baayen space odyssey. On the occasion of the retirement of Prof Dr. P. C. Baayen. Amsterdam: CWI. 493--534 (1995; Zbl 0851.57011)
Su, Xiang-Ying Paths, cycles, and arc-connectivity in digraphs. (English) Zbl 0824.05040 J. Graph Theory 19, No. 3, 339-351 (1995). Reviewer: N.F.Quimpo (Manila) MSC: 05C38 05C40 05C20 PDF BibTeX XML Cite \textit{X.-Y. Su}, J. Graph Theory 19, No. 3, 339--351 (1995; Zbl 0824.05040) Full Text: DOI
Guo, Yubao; Volkmann, Lutz A generalization of Menger’s theorem for certain block-cactus graphs. (English) Zbl 0819.05037 Graphs Comb. 11, No. 1, 49-52 (1995). Reviewer: B.Andrásfai (Budapest) MSC: 05C38 PDF BibTeX XML Cite \textit{Y. Guo} and \textit{L. Volkmann}, Graphs Comb. 11, No. 1, 49--52 (1995; Zbl 0819.05037) Full Text: DOI
Knor, M. On the number of cycles in \(k\)-connected graphs. (English) Zbl 0827.05035 Acta Math. Univ. Comen., New Ser. 63, No. 2, 315-321 (1994). Reviewer: R.Scapellato (Milano) MSC: 05C38 05C30 05C40 PDF BibTeX XML Cite \textit{M. Knor}, Acta Math. Univ. Comen., New Ser. 63, No. 2, 315--321 (1994; Zbl 0827.05035) Full Text: EMIS EuDML
Erdös, Péter L.; Székely, László A. On weighted multiway cuts in trees. (English) Zbl 0805.05016 Math. Program. 65, No. 1 (A), 93-105 (1994). Reviewer: S.F.Kapoor (Kalamazoo) MSC: 05C05 90C39 90C35 05C70 90C27 PDF BibTeX XML Cite \textit{P. L. Erdös} and \textit{L. A. Székely}, Math. Program. 65, No. 1 (A), 93--105 (1994; Zbl 0805.05016) Full Text: DOI
Faudree, R. J. Some strong variations of connectivity. (English) Zbl 0791.05067 Miklós, D. (ed.) et al., Combinatorics, Paul Erdős is eighty. Vol. 1. Budapest: János Bolyai Mathematical Society. Bolyai Society Mathematical Studies. 125-144 (1993). MSC: 05C40 05C38 PDF BibTeX XML Cite \textit{R. J. Faudree}, in: Combinatorics, Paul Erdős is eighty. Vol. 1. Budapest: János Bolyai Mathematical Society. 125--144 (1993; Zbl 0791.05067)
Pyber, László; Tuza, Zsolt Menger-type theorems with restrictions on path lengths. (English) Zbl 0789.05050 Discrete Math. 120, No. 1-3, 161-174 (1993). Reviewer: L.Niepel (Bratislava) MSC: 05C38 05C35 PDF BibTeX XML Cite \textit{L. Pyber} and \textit{Z. Tuza}, Discrete Math. 120, No. 1--3, 161--174 (1993; Zbl 0789.05050) Full Text: DOI
Steel, Michael Decompositions of leaf-colored binary trees. (English) Zbl 0777.05047 Adv. Appl. Math. 14, No. 1, 1-24 (1993). Reviewer: P.L.Erdös (Almare) MSC: 05C05 05C15 05C70 92D15 PDF BibTeX XML Cite \textit{M. Steel}, Adv. Appl. Math. 14, No. 1, 1--24 (1993; Zbl 0777.05047) Full Text: DOI
Steel, M. A. Distributions on bicoloured binary trees arising from the principle of parsimony. (English) Zbl 0777.05046 Discrete Appl. Math. 41, No. 3, 245-261 (1993). Reviewer: G.Wegner (Dortmund) MSC: 05C05 05C35 05C30 05C15 92D15 PDF BibTeX XML Cite \textit{M. A. Steel}, Discrete Appl. Math. 41, No. 3, 245--261 (1993; Zbl 0777.05046) Full Text: DOI
Xu, Junming Note on Menger’s theorem of the edge form in graph theory. (Chinese. English summary) Zbl 0890.05042 Math. Appl. 5, No. 3, 60-61 (1992). MSC: 05C40 PDF BibTeX XML Cite \textit{J. Xu}, Math. Appl. 5, No. 3, 60--61 (1992; Zbl 0890.05042)
Sampathkumar, E. A generalization of Menger’s theorem for certain unicyclic graphs. (English) Zbl 0778.05045 Graphs Comb. 8, No. 4, 377-380 (1992). Reviewer: B.Andrásfai (Budapest) MSC: 05C35 05C38 PDF BibTeX XML Cite \textit{E. Sampathkumar}, Graphs Comb. 8, No. 4, 377--380 (1992; Zbl 0778.05045) Full Text: DOI
Polat, Norbert A Mengerian theorem for infinite graphs with ideal points. (English) Zbl 0662.05043 J. Comb. Theory, Ser. B 51, No. 2, 248-255 (1991). Reviewer: N.Polat MSC: 05C40 PDF BibTeX XML Cite \textit{N. Polat}, J. Comb. Theory, Ser. B 51, No. 2, 248--255 (1991; Zbl 0662.05043) Full Text: DOI
Aharoni, Ron Infinite matching theory. (English) Zbl 0763.05074 Discrete Math. 95, No. 1-3, 5-22 (1991). MSC: 05C70 05C65 05D15 90C05 15B51 PDF BibTeX XML Cite \textit{R. Aharoni}, Discrete Math. 95, No. 1--3, 5--22 (1991; Zbl 0763.05074) Full Text: DOI
Egawa, Yoshimi; Kaneko, Atsushi; Matsumoto, Makoto A mixed version of Menger’s theorem. (English) Zbl 0759.05059 Combinatorica 11, No. 1, 71-74 (1991). Reviewer: M.Hager (Leonberg) MSC: 05C40 PDF BibTeX XML Cite \textit{Y. Egawa} et al., Combinatorica 11, No. 1, 71--74 (1991; Zbl 0759.05059) Full Text: DOI
Rayburn, Nell Kimmins A Menger-type characterization of local connectivity. (English) Zbl 0698.05052 Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 73, 235-238 (1990). Reviewer: M.Hager MSC: 05C40 PDF BibTeX XML
Brochet, J. M.; Pouzet, M. Two extremal problems in infinite ordered sets and graphs: Infinite versions of Menger and Gallai-Milgram theorems for ordered sets and graphs. (English) Zbl 0738.05049 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, 51-74 (1990). Reviewer: C.Godsil (Waterloo / Ontario) MSC: 05C35 05C40 05C99 PDF BibTeX XML
Li, Boyu The PT-order, minimal cutsets and Menger property. (English) Zbl 0693.06001 Order 6, No. 1, 59-68 (1989). Reviewer: K.Engel MSC: 06A06 PDF BibTeX XML Cite \textit{B. Li}, Order 6, No. 1, 59--68 (1989; Zbl 0693.06001) Full Text: DOI
Topp, Jerzy; Volkmann, Lutz A generalization of Menger’s theorem for trees. (English) Zbl 0855.05046 J. Comb. Inf. Syst. Sci. 14, No. 4, 249-250 (1989). MSC: 05C05 05C38 PDF BibTeX XML Cite \textit{J. Topp} and \textit{L. Volkmann}, J. Comb. Inf. Syst. Sci. 14, No. 4, 249--250 (1989; Zbl 0855.05046)
Jørgensen, L. K. On p vertices pairwise joined by edge-disjoint paths. (English) Zbl 0698.05046 Combinatorics, Proc. 7th Hung. Colloq., Eger/Hung. 1987, Colloq. Math. Soc. János Bolyai 52, 571-573 (1988). Reviewer: N.Quimpo MSC: 05C38 05C15 PDF BibTeX XML
Aharoni, R.; Brochet, J.-M.; Pouzet, M. The Menger property for infinite ordered sets. (English) Zbl 0678.06002 Order 5, No. 3, 305-315 (1988). Reviewer: M.Höft MSC: 06A06 PDF BibTeX XML Cite \textit{R. Aharoni} et al., Order 5, No. 3, 305--315 (1988; Zbl 0678.06002) Full Text: DOI
Brochet, J.-M.; Pouzet, M. Maximal chains and cutsets of an ordered set: A Menger type approach. (English) Zbl 0678.06001 Order 5, No. 3, 289-304 (1988). Reviewer: M.Höft MSC: 06A06 54D30 PDF BibTeX XML Cite \textit{J. M. Brochet} and \textit{M. Pouzet}, Order 5, No. 3, 289--304 (1988; Zbl 0678.06001) Full Text: DOI
Hamidoune, Yahya Ould; Las Vergnas, Michel Local edge-connectivity in regular bipartite graphs. (English) Zbl 0662.05042 J. Comb. Theory, Ser. B 44, No. 3, 370-371 (1988). Reviewer: N.C.Wormald MSC: 05C40 PDF BibTeX XML Cite \textit{Y. O. Hamidoune} and \textit{M. Las Vergnas}, J. Comb. Theory, Ser. B 44, No. 3, 370--371 (1988; Zbl 0662.05042) Full Text: DOI
Quilliot, Alain Un problème de connectivité sur les espaces métriques. (French) Zbl 0551.05050 Eur. J. Comb. 5, 243-253 (1984). Reviewer: M.Marx MSC: 05C40 54D05 PDF BibTeX XML Cite \textit{A. Quilliot}, Eur. J. Comb. 5, 243--253 (1984; Zbl 0551.05050) Full Text: DOI
Xu, Junming Proof of the mixed form of Menger’s theorem in graph theory. (Chinese. English summary) Zbl 0548.05038 J., Huazhong (Cent. China) Univ. Sci. Technol. 12, No. 2, 17-18 (1984). Reviewer: H.P.Yap MSC: 05C40 05C38 PDF BibTeX XML
Royer, Antoine On some partitions of hypergraphs and cumulants having applications in statistical mechanics. (English) Zbl 0547.05050 J. Math. Phys. 25, 1157-1175 (1984). Reviewer: O.Frank MSC: 05C65 05C40 60K35 PDF BibTeX XML Cite \textit{A. Royer}, J. Math. Phys. 25, 1157--1175 (1984; Zbl 0547.05050) Full Text: DOI
McCuaig, William A simple proof of Menger’s theorem. (English) Zbl 0545.05042 J. Graph Theory 8, 427-429 (1984). Reviewer: M.Hager MSC: 05C40 05C20 PDF BibTeX XML Cite \textit{W. McCuaig}, J. Graph Theory 8, 427--429 (1984; Zbl 0545.05042) Full Text: DOI
Polat, Norbert Sur une extension du théorème de Menger aux graphes infinis. (On an extension of Menger’s theorem to infinite graphs). (French) Zbl 0576.05043 Eur. J. Comb. 4, 359-365 (1983). MSC: 05C38 05C40 PDF BibTeX XML Cite \textit{N. Polat}, Eur. J. Comb. 4, 359--365 (1983; Zbl 0576.05043) Full Text: DOI
Dancs, S.; Hegedüs, M.; Medvegyev, P. A general ordering and fixed-point principle in complete metric space. (English) Zbl 0532.54030 Acta Sci. Math. 46, 381-388 (1983). Reviewer: L.Gorniewicz MSC: 54H25 47H10 28A12 PDF BibTeX XML Cite \textit{S. Dancs} et al., Acta Sci. Math. 46, 381--388 (1983; Zbl 0532.54030)
Aharoni, Ron Menger’s theorem for graphs containing no infinite paths. (English) Zbl 0525.05043 Eur. J. Comb. 4, 201-204 (1983). MSC: 05C40 05C70 PDF BibTeX XML Cite \textit{R. Aharoni}, Eur. J. Comb. 4, 201--204 (1983; Zbl 0525.05043) Full Text: DOI
Exoo, Geoffrey On line disjoint paths of bounded length. (English) Zbl 0507.05041 Discrete Math. 44, 317-318 (1983). MSC: 05C40 05C35 05C38 PDF BibTeX XML Cite \textit{G. Exoo}, Discrete Math. 44, 317--318 (1983; Zbl 0507.05041) Full Text: DOI
Schrijver, A. Min-max relations for directed graphs. (English) Zbl 0497.05029 Ann. Discrete Math. 16, 261-280 (1982). MSC: 05C20 05C40 PDF BibTeX XML Full Text: DOI
Menger, Karl On the origin of the n-arc theorem. (English) Zbl 0468.05050 J. Graph Theory 5, 341-350 (1981). MSC: 05C40 05-03 01A65 PDF BibTeX XML Cite \textit{K. Menger}, J. Graph Theory 5, 341--350 (1981; Zbl 0468.05050) Full Text: DOI
Halin, Rudolf Graphentheorie. I. (English) Zbl 0438.05026 Erträge der Forschung, Band 138. Darmstadt: Wissenschaftliche Buchgesellschaft. XIX, 321 S. DM 47.00 (1980). MSC: 05Cxx 05-01 05C05 05C38 05C40 05C15 PDF BibTeX XML
Bryant, Victor; Perfect, Hazel Independence theory in combinatorics. An introductory account with applications to graphs and transversals. (English) Zbl 0435.05017 Chapman and Hall Mathematics Series. London-New York: Chapman and Hall. XII, 144 p. hbk: £10.00; pbk: £5.50 (1980). MSC: 05B35 05C20 05C99 PDF BibTeX XML
Woodall, D. R. Minimax theorems in graph theory. (English) Zbl 0433.05036 Selected topics in graph theory, 237-269 (1978). MSC: 05C35 05C99 PDF BibTeX XML
O’Neil, Peter V. A new proof of Menger’s theorem. (English) Zbl 0407.05058 J. Graph Theory 2, 257-259 (1978). MSC: 05C40 PDF BibTeX XML Cite \textit{P. V. O'Neil}, J. Graph Theory 2, 257--259 (1978; Zbl 0407.05058) Full Text: DOI
Hadziivanov, N. G. On products of continua. (Russian) Zbl 0402.54040 C. R. Acad. Bulg. Sci. 31, 1241-1244 (1978). MSC: 54F15 54F45 54B10 PDF BibTeX XML Cite \textit{N. G. Hadziivanov}, C. R. Acad. Bulg. Sci. 31, 1241--1244 (1978; Zbl 0402.54040)