2000 character limit reached
On Frank's conjecture on k-connected orientations
Published 17 Dec 2012 in math.CO and cs.DM | (1212.4086v1)
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.