Paths and edge-connectivity in graphs. III: Six-terminal k paths

DOI10.1007/BF01788539zbMath0643.05047MaRDI QIDQ1101467

Haruko Okamura

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

connectivityendsedge-disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (1)

Every 4k-edge-connected graph is weakly 3k-linked

Cites Work

• Unnamed Item
• A sufficient condition for a graph to be weakly k-linked
• Paths and edge-connectivity in graphs
• Disjoint paths in graphs
• 2-linked graphs
• A Reduction Method for Edge-Connectivity in Graphs

This page was built for publication: Paths and edge-connectivity in graphs. III: Six-terminal k paths