| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656807 | Journal of Combinatorial Theory, Series B | 2015 | 12 Pages |
Abstract
We prove that a graph admits a strongly 2-connected orientation if and only if it is 4-edge-connected, and every vertex-deleted subgraph is 2-edge-connected. In particular, every 4-connected graph has such an orientation while no cubic 3-connected graph has such an orientation.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carsten Thomassen,