A sufficient condition for a graph to be weakly k-linked

DOI10.1016/0095-8956(84)90015-7zbMath0535.05042OpenAlexW2091662889MaRDI QIDQ790839

Kiyohito Kubota, Osami Saito, Tomio Hirata

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90015-7

zbMATH Keywords

edge-disjoint pathsweakly k-linked

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (6)

Paths and edge-connectivity in graphs. III: Six-terminal k paths ⋮ Shortest edge-disjoint paths in graphs ⋮ On the maximum degree of path-pairable planar graphs ⋮ Every 4k-edge-connected graph is weakly 3k-linked ⋮ Paths and edge-connectivity in graphs ⋮ Paths in graphs, reducing the edge-connectivity only by two

Cites Work

• 2-linked graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A sufficient condition for a graph to be weakly k-linked