2-reducible two paths and an edge constructing a path in (2k + 1)-edge-connected graphs

DOI10.1007/S00373-010-0932-YMaRDI QIDQ604983zbMATH OpenOpenAlexFDO

Authors Haruko Okamura

Publication date 12 November 2010

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

Full work available at URL https://doi.org/10.1007/s00373-010-0932-y

zbMATH Keywords

2-reducible\(k\)-edge-connecteddisjoint 2 paths

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2188367
• scientific article; zbMATH DE number 475593
• Two paths joining given vertices in \(2k\)-edge-connected graphs
• Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs
• scientific article; zbMATH DE number 2192206
• Paths in graphs, reducing the edge-connectivity only by two
• 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
• scientific article; zbMATH DE number 3916310
• scientific article; zbMATH DE number 3991542
• Two-edge-connected \([2,k]\)-factors in graphs

Cites work

• 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
• 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Counterexamples to a conjecture of Mader about cycles through specified vertices in n-edge-connected graphs
• scientific article; zbMATH DE number 475593 (Why is no real title available?)
• scientific article; zbMATH DE number 2188367 (Why is no real title available?)
• scientific article; zbMATH DE number 2192206 (Why is no real title available?)
• On a theorem of Mader
• Two paths joining given vertices in \(2k\)-edge-connected graphs

Cited in

(8)

• Paths in graphs, reducing the edge-connectivity only by two
• Two paths joining given vertices in \(2k\)-edge-connected graphs
• scientific article; zbMATH DE number 475593 (Why is no real title available?)
• scientific article; zbMATH DE number 2192206 (Why is no real title available?)
• 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs
• The constructive characterization of (k,l)-edge-connected digraphs
• Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs
• 2-reducible two paths and two edges constructing a cycle in (2k+1)-edge-connected graphs

This page was built for publication: 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs

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