On Frank's conjecture on k-connected orientations

Abstract

We disprove a conjecture of Frank [4] stating that each weakly 2k-connected graph has a k-vertex-connected orientation. For k ≥ 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete. 

Topics

5 Figures and Tables

Slides referencing similar topics