On Frank's conjecture on k-connected orientations
Combinatorics
2012-12-18 v1 Discrete Mathematics
Abstract
We disprove a conjecture of Frank stating that each weakly 2k-connected has a k-vertex-connected orientation. For k at least 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete.
Keywords
Cite
@article{arxiv.1212.4086,
title = {On Frank's conjecture on k-connected orientations},
author = {Olivier Durand de Gevigney},
journal= {arXiv preprint arXiv:1212.4086},
year = {2012}
}