Strongly 2-connected orientations of graphs

DOI10.1016/j.jctb.2014.07.004zbMath1302.05096OpenAlexW1983149300WikidataQ56926551 ScholiaQ56926551MaRDI QIDQ473099

Carsten Thomassen

Publication date: 21 November 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2014.07.004

zbMATH Keywords

connectivityorientations

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (13)

Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs ⋮ The maximum average connectivity among all orientations of a graph ⋮ Partially broken orientations of Eulerian plane graphs ⋮ On orientations maximizing total arc-connectivity ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Complexity of (arc)-connectivity problems involving arc-reversals or deorientations ⋮ The complexity of 2-vertex-connected orientation in mixed graphs ⋮ Enumerating \(k\)-arc-connected orientations ⋮ Eulerian orientations and vertex-connectivity ⋮ On Frank's conjecture on \(k\)-connected orientations ⋮ On Eulerian orientations of even-degree hypercubes ⋮ Tournaments and Semicomplete Digraphs ⋮ Lexicographic Orientation Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing of rigid spanning subgraphs and spanning trees
• The weak 3-flow conjecture and the weak circular flow conjecture
• What is on his mind?
• On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On some connectivity properties of Eulerian graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Two‐connected orientations of Eulerian graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: Strongly 2-connected orientations of graphs