The Nash-Williams orientation theorem for graphs with countably many ends
From MaRDI portal
Publication:6655682
DOI10.1016/J.EJC.2024.104043MaRDI QIDQ6655682
Max F. Pitz, Marcel Koloschin, Amena Assem
Publication date: 27 December 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
- What is on his mind?
- On a theorem of Mader
- On end degrees and infinite cycles in locally finite graphs
- Simultaneous well-balanced orientations of graphs
- On Orientations, Connectivity and Odd-Vertex-Pairings in 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
- Constrained Edge-Splitting Problems
- Orientations of infinite graphs with prescribed edge-connectivity
Related Items (2)
The Lovász-Cherkassky theorem in infinite graphs ⋮ Towards Nash-Williams orientation conjecture for infinite graphs
This page was built for publication: The Nash-Williams orientation theorem for graphs with countably many ends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655682)
