Abstract
We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is NP-hard. This answers a question of Bang-Jensen, Huang and Zhu. For the second part, we call a directed graph D=(V,A)2T-connected for some T⊆V if D is 2-arc-connected and D−v is strongly connected for all v∈T. We deduce a characterization of the graphs admitting a 2T-connected orientation from the theorem of Thomassen.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
