TR-2004-03

Two-connected orientations of Eulerian graphs

Alex Berg, Tibor Jordán

Published in:
J. Graph Theory, Vol. 52, Issue 3, 230-242, 2006.

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\in 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.

Bibtex entry:

@techreport{egres-04-03,

AUTHOR	=	{Berg, Alex and Jord{\'a}n, Tibor},
TITLE	=	{Two-connected orientations of Eulerian graphs},
NOTE	=	{{\tt egres.elte.hu}},
INSTITUTION	=	{Egerv{\'a}ry Research Group, Budapest},
YEAR	=	{2004},
NUMBER	=	{TR-2004-03}

}