Connectivity of orientations of 3-edge-connected graphs

DOI10.1016/j.ejc.2020.103292zbMath1464.05216arXiv2012.03259OpenAlexW3114697770MaRDI QIDQ2662789

Florian Hoersch, Zoltán Szigeti

Publication date: 14 April 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.03259

zbMATH Keywords

Nash-Williams theoremdeletable arcFrank number

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

Improved upper bound on the Frank number of 3-edge-connected graphs ⋮ Unnamed Item ⋮ Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes

Cites Work

• Unnamed Item
• Simultaneous well-balanced orientations of graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• The complexity of satisfiability problems
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Combinatorial optimization. Theory and algorithms.