𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-connected orientations of Eulerian graphs

✍ Scribed by Alex R. Berg; Tibor Jordán

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
116 KB
Volume
52
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

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

📜 SIMILAR VOLUMES

Eulerian subgraphs in 3-edge-connected g
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs
✍ Zhi-Hong Chen; Hong-Jian Lai; Xiangwen Li; Deying Li; Jinzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract In this paper, we show that if __G__ is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either __G__ has an Eulerian subgraph __H__ such that $S \subseteq V(H)$, or __G__ can be contracted to the Petersen graph in such a way that the preimage of each vertex of th

Acyclic Orientations of Random Graphs
Acyclic Orientations of Random Graphs
✍ C.M Reidys 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 195 KB

An acyclic orientation of an undirected graph is an orientation of its edges such that the resulting directed graph contains no cycles. The random graph G is a n, p probability space consisting of subgraphs of K that are obtained by selecting each n K -edge with independent probability p. The random

Two-Connected Augmentation Problems in P
Two-Connected Augmentation Problems in Planar Graphs
✍ J.Scott Provan; Roger C Burk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Given a weighted undirected graph G and a subgraph S of G, we consider the problem of adding a minimum-weight set of edges of G to S so that the resulting Ž . subgraph satisfies specified edge or vertex connectivity requirements between pairs of nodes of S. This has important applications in upgradi

Sinks in Acyclic Orientations of Graphs
Sinks in Acyclic Orientations of Graphs
✍ David D. Gebhard; Bruce E. Sagan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Greene and Zaslavsky proved that the number of acyclic orientations of a graph G with a unique sink at a given vertex is, up to sign, the linear coefficient of the chromatic polynomial. We give three proofs of this result using pure induction, noncommutative symmetric functions, and an algorithmic b