Paths and edge-connectivity in graphs

DOI10.1016/0095-8956(84)90069-8MaRDI QIDQ799691zbMATH OpenOpenAlexFDO

Authors Haruko Okamura

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)90069-8

zbMATH Keywords

edge-disjoint pathslinked graphs

Mathematics Subject Classification ID

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

Recommendations

• Two paths joining given vertices in \(2k\)-edge-connected graphs
• scientific article; zbMATH DE number 2192206
• Disjoint paths in graphs. (Reprint)
• Paths in graphs, reducing the edge-connectivity only by two
• Edge-disjoint paths and cycles inn-edge-connected graphs

Cites work

• scientific article; zbMATH DE number 3947966 (Why is no real title available?)
• 2-linked graphs
• A Reduction Method for Edge-Connectivity in Graphs
• A sufficient condition for a graph to be weakly k-linked
• Disjoint paths in graphs
• Three commodity flows in graphs

Cited in

(36)

• scientific article; zbMATH DE number 7301719 (Why is no real title available?)
• Paths through K-specified edges in a linear graph
• scientific article; zbMATH DE number 4147534 (Why is no real title available?)
• scientific article; zbMATH DE number 6475963 (Why is no real title available?)
• scientific article; zbMATH DE number 524123 (Why is no real title available?)
• Paths and trails in edge-colored graphs
• On the mixed connectivity conjecture of Beineke and Harary
• scientific article; zbMATH DE number 3991542 (Why is no real title available?)
• scientific article; zbMATH DE number 2192206 (Why is no real title available?)
• Edge-disjoint trees containing some given vertices in a graph
• scientific article; zbMATH DE number 1744097 (Why is no real title available?)
• Note on Whitney's theorem for \(k\)-connected graphs
• Mader tools
• Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs
• Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair
• Paths in graphs, reducing the edge-connectivity only by two
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
• Induced paths in 5-connected graphs
• Local edge and local node connectivity in regular graphs
• Bounds on path connectivity
• 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
• Disjoint paths in graphs. (Reprint)
• Paths and edge-connectivity in graphs. III: Six-terminal k paths
• Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
• Connectivity keeping paths in \(k\)-connected bipartite graphs
• A sufficient condition for a graph to be weakly k-linked
• scientific article; zbMATH DE number 3957153 (Why is no real title available?)
• On a theorem of Mader
• A generalization of a theorem of Dirac
• Path transferability of graphs
• Two paths joining given vertices in \(2k\)-edge-connected graphs
• Every 4k-edge-connected graph is weakly 3k-linked
• Paths and circuits in g-graphs
• A sufficient condition for graphs to be weakly \(k\)-linked
• scientific article; zbMATH DE number 4177105 (Why is no real title available?)
• Local edge-connectivity in regular bipartite graphs

This page was built for publication: Paths and edge-connectivity in graphs

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