Paths containing two adjacent edges in (2k+1)-edge-connected graphs

DOI10.1016/0012-365X(93)90177-UMaRDI QIDQ686504zbMATH OpenOpenAlexWikidataFDO

Authors Haruko Okamura

Publication date 24 May 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90177-u

zbMATH Keywords

cyclepath2-reducible paths and cycles

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
• 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs
• scientific article; zbMATH DE number 2188367
• scientific article; zbMATH DE number 3991542
• scientific article; zbMATH DE number 3916310
• Edge-connectivity in \(P_k\)-path graphs
• Paths in graphs, reducing the edge-connectivity only by two
• On the number of edges in a graph with many two-hop disjoint paths
• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices

Cites work

• scientific article; zbMATH DE number 4177105 (Why is no real title available?)
• A Reduction Method for Edge-Connectivity in Graphs
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected 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

Cited in

(8)

• Edge-disjoint paths and cycles inn-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
• Paths in graphs, reducing the edge-connectivity only by two
• 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
• Two paths joining given vertices in \(2k\)-edge-connected graphs
• Paths with two blocks in k-chromatic digraphs

This page was built for publication: Paths containing two adjacent edges 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 Q686504)