✦ LIBER ✦

On the number of Eulerian orientations of a graph

✍ Scribed by Mihail, M. (author);Winkler, P. (author)

Book ID: 120137036
Publisher: Springer New York
Year: 1996
Tongue: English
Weight: 315 KB
Volume: 16
Category: Article
ISSN: 0178-4617
DOI: 10.1007/BF01940872

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of Eulerian orientations o

On the number of Eulerian orientations of a graph

✍ Mihail, M. (author);Winkler, P. (author) 📂 Article 📅 1996 🏛 Springer New York 🌐 English ⚖ 315 KB

Bounds on the number of Eulerian orienta

Bounds on the number of Eulerian orientations

✍ A. Schrijver 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 255 KB

An upper bound for the number of Euleria

An upper bound for the number of Eulerian orientations of a regular graph

✍ M. Las Vergnas 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 168 KB

The asymptotic numbers of regular tourna

The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs

✍ Brendan D. McKay 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 427 KB

Asymptotic behavior of the number of Eul

Asymptotic behavior of the number of Eulerian orientations of graphs

✍ M. I. Isaev 📂 Article 📅 2013 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 623 KB

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