×

zbMATH — the first resource for mathematics

2-linked graphs. (English) Zbl 0457.05044

MSC:
05C38 Paths and cycles
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Edmonds, J., Minimum partition of a matroid into independent subsets, J. res. nat. bur. standards sect. B, 69, 67-72, (1965) · Zbl 0192.09101
[2] Edmonds, J., Edge-disjoint branchings, (), 91-96
[3] Even, S.; Itai, A.; Shamir, A., On the complexity of time-table and multi-commodity flow problems, SIAM J. comput., 5, 691-703, (1976) · Zbl 0358.90021
[4] S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, to appear. · Zbl 0419.05028
[5] Halin, R., Simplicial decompositions of infinite graphs, Ann. discrete math., 3, 93-109, (1978) · Zbl 0383.05034
[6] Hu, T.C., Multicommodity network flows, Oper. res., 11, 344-360, (1963) · Zbl 0123.23704
[7] Jung, H.A., Eine verallgemeinerung des n-fachen zusammenhangs für graphen, Math. ann., 187, 95-103, (1970) · Zbl 0184.27601
[8] Larman, D.G.; Mani, P., On the existence of certain configurations within graphs and the 1-sceletons of polytopes, Proc. London math. soc., 20, 144-160, (1970) · Zbl 0201.56801
[9] Lovász, L., Problem 5, Period. math. hungar., 4, 82, (1973)
[10] Lovász, L., On two minimax theorems in graph, J. combin. theory ser. B, 21, 96-103, (1976) · Zbl 0337.05115
[11] Mader, W., Hinreichende bedingungen für die existenz von teilgraphen, Die zu einem vollständigen graphen homöomorph sind, math. nachr., 53, 145-150, (1972) · Zbl 0217.02504
[12] Mader, W., Connectivity and edge-connectivity in finite graphs, (), 66-95 · Zbl 0404.05040
[13] Nash-Williams, C.St.J.A., On orientations, Connectivity and odd-vertex-pairings in finite graphs, canad. J. math., 12, 555-567, (1960) · Zbl 0096.38002
[14] Nash-Williams, C.St.J.A., Edge-disjoint spanning trees of finite graphs, J. London math. soc., 36, 445-450, (1961) · Zbl 0102.38805
[15] Seshu, S.; Reed, M.B., Linear graphs and electrical networks, (1961), Addison-Wesley London · Zbl 0102.34001
[16] Seymour, P.D., Disjoint paths in graphs, Discrete math., 29, 293-309, (1980) · Zbl 0457.05043
[17] Shiloach, Y., A polynomial solution to the undirected two paths problem, J. assoc. comput. Mach., 3, 445-456, (1980) · Zbl 0475.68042
[18] Thomassen, C., Note on circuits containing specified edges, J. combin. theory ser. B, 22, 279-280, (1977) · Zbl 0364.05031
[19] Thomassen, C., Planarity and duality of finite and infinite graphs, J. combin. theory ser. B, 29, 244-271, (1980) · Zbl 0441.05023
[20] Thomassen, C., 2-linked graphs, preprint series 1979/80, no. 17, (1979), Matematisk Institut, Aarhus Universitet
[21] Tutte, W.T., On the problem of decomposing a graph into n connected factors, J. London math. soc., 36, 221-230, (1961) · Zbl 0096.38001
[22] Watkins, W., On the existence of certain disjoint arcs in graphs, Duke math., 135, 231-246, (1968) · Zbl 0176.22301
[23] Woodall, D.R., Circuits containing specified edges, J. combin. theory ser. B, 22, 274-278, (1977) · Zbl 0362.05069
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.