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

DOI10.1016/0095-8956(84)90015-7zbMATH Open0535.05042OpenAlexW2091662889MaRDI QIDQ790839FDOQ790839

Authors: Tomio Hirata, Kiyohito Kubota, Osami Saito 

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

Recommendations

• A sufficient condition for graphs to be weakly \(k\)-linked
• Paths and edge-connectivity in graphs
• Every 4k-edge-connected graph is weakly 3k-linked
• An improved linear edge bound for graph linkages
• Highly linked graphs

zbMATH Keywords

edge-disjoint pathsweakly k-linked

Mathematics Subject Classification ID

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

Cites Work

• 2-linked graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790839)