论文信息 - Two‐connected orientations of Eulerian graphs

Two‐connected orientations of Eulerian graphs

A graph G = (V,E) is said to be weakly four-connected if G is 4-edgeconnected 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.

Tibor Jordán | Alex R. Berg | Tibor Jordán | T. Jordán

[1] Tibor Jordán. A characterization of weakly four-connected graphs , 2006, J. Graph Theory.

[2] András Frank,et al. Connectivity and network flows , 1996 .

[3] Tibor Jordán,et al. Sparse certificates and removable cycles in l-mixed p-connected graphs , 2005, Oper. Res. Lett..

[4] H. Robbins. A Theorem on Graphs, with an Application to a Problem of Traffic Control , 1939 .

[5] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.

[6] Tibor Jord. On the existence of k edge-disjoint 2-connected spanning subgraphs , 2004 .

[7] Carsten Thomassen,et al. Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number , 1989 .

[8] C. Nash-Williams. On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs , 1960, Canadian Journal of Mathematics.

[9] L. Lovász. Combinatorial problems and exercises , 1979 .