Orientations of infinite graphs with prescribed edge-connectivity
From MaRDI portal
Publication:5915870
DOI10.1007/S00493-015-3173-0zbMath1399.05139DBLPjournals/combinatorica/Thomassen16OpenAlexW860446066WikidataQ56926513 ScholiaQ56926513MaRDI QIDQ5915870
Publication date: 22 February 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/c7dab84e-3c21-4ed2-a00f-44f3754f2105
Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63)
Related Items (3)
Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Even A‐cycles have the edge‐Erdős–Pósa property ⋮ Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
Cites Work
- Unnamed Item
- The weak 3-flow conjecture and the weak circular flow conjecture
- What is on his mind?
- 2-linked graphs
- A note on Menger's theorem for infinite locally finite graphs
- Decompositions of infinite graphs. I: Bond-faithful decompositions
- Graphs in which every finite path is contained in a circuit
- On the Problem of Decomposing a Graph into n Connected Factors
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Infinite, highly connected digraphs with no two arc-disjoint spanning trees
- On some connectivity properties of Eulerian graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Infinite graphs—A survey
- Minimum partition of a matroid into independent subsets
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: Orientations of infinite graphs with prescribed edge-connectivity
