Two-connected orientations of Eulerian graphs

Alex R. Berg, Tibor Jordán

Research output: Contribution to journalArticle

8 Citations (Scopus)


A graph G = (V, E) is said to be weakly four-connected if G is 4-edge-connected and G - x is 2-edge-connected for every x ∈ V. We prove that every weakly four-connected Eulerian graph has a 2-connected Eulerian orientation. This verifies a special case of a conjecture of A. Frank.

Original languageEnglish
Pages (from-to)230-242
Number of pages13
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - Jul 1 2006



  • Connectivity of graphs
  • Eulerian graph
  • Orientation

ASJC Scopus subject areas

  • Geometry and Topology

Cite this