Two-connected orientations of Eulerian graphs

被引：14

作者：

Berg, Alex R.

Jordan, Tibor

机构：

[1] Univ Aarhus, Danish Natl Res Fdn, Basic Res Comp Sci Ctr, DK-8200 Aarhus N, Denmark

[2] Eotvos Lorand Univ, Dept Operat Res, H-1117 Budapest, Hungary

来源：

JOURNAL OF GRAPH THEORY | 2006年 / 52卷 / 03期

关键词：

connectivity of graphs; orientation; Eulerian graph;

D O I：

10.1002/jgt.20158

中图分类号：

O1 [数学];

学科分类号：

0701 [数学]; 070101 [基础数学];

摘要：

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 is an element of 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. (C) 2006 Wiley Periodicals, Inc.

引用

页码：230 / 242

页数：13

共 10 条

[1]

Sparse certificates and removable cycles in l-mixed p-connected graphs [J].