𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph orientations with set connectivity requirements

✍ Scribed by Takuro Fukunaga

Book ID
113567667
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
262 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The connectivity of acyclic orientation
The connectivity of acyclic orientation graphs
✍ Carla D. Savage; Cun-Quan Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 362 KB

The acyclic orientation graph, AO(G), of an undirected graph, G, is the graph whose vertices are the acyclic orientations of G and whose edges are the pairs of orientations differing only by the reversal of one edge. Edelman (1984) has observed that it follows from results on polytopes that when G i

Two-connected orientations of Eulerian g
Two-connected orientations of Eulerian graphs
✍ Alex R. Berg; Tibor Jordán 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## 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