Premium
Two‐connected orientations of Eulerian graphs
Author(s) -
Berg Alex R.,
Jordán Tibor
Publication year - 2006
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20158
Subject(s) - eulerian path , combinatorics , mathematics , conjecture , connectivity , graph , orientation (vector space) , enhanced data rates for gsm evolution , discrete mathematics , computer science , geometry , pure mathematics , artificial intelligence , lagrangian
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 . © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 230–242, 2006