Strongly 2-connected orientations of graphs

Research output: Contribution to journalJournal articleResearchpeer-review

506 Downloads (Pure)

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.
Original languageEnglish
JournalJournal of Combinatorial Theory. Series B
Volume110
Pages (from-to)67-78
ISSN0095-8956
DOIs
Publication statusPublished - 2014

Keywords

  • Orientations
  • Connectivity

Fingerprint Dive into the research topics of 'Strongly 2-connected orientations of graphs'. Together they form a unique fingerprint.

Cite this