Paths containing two adjacent edges in (2k+1)-edge-connected graphs
From MaRDI portal
Publication:686504
DOI10.1016/0012-365X(93)90177-UzbMATH Open0787.05062OpenAlexW2055635002WikidataQ127152277 ScholiaQ127152277MaRDI QIDQ686504FDOQ686504
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
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
- A Reduction Method for Edge-Connectivity in Graphs
- Every 4k-edge-connected graph is weakly 3k-linked
- 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
- Title not available (Why is that?)
- Paths and edge-connectivity in graphs
Cited In (8)
- Edge-disjoint paths and cycles inn-edge-connected graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
