𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strongly connected orientations of mixed multigraphs

✍ Scribed by Fan R. K. Chung; Michael R. Garey; Robert E. Tarjan

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
452 KB
Volume
15
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The edge chromatic number of a directed/
The edge chromatic number of a directed/mixed multigraph
✍ Mel'nikov, Leonid S.; Vizing, Vadim G. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB 👁 2 views

We consider colorings of the directed and undirected edges of a mixed multigraph G by an ordered set of colors. We color each undirected edge in one color and each directed edge in two colors, such that the color of the first half of a directed edge is smaller than the color of the second half. The

The w-median of a connected strongly cho
The w-median of a connected strongly chordal graph
✍ Hai-Yen Lee; Gerard J. Chang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 1 views

## Abstract Suppose __G = (V, E)__ is a graph in which every vertex __x__ has a non‐negative real number __w(x)__ as its weight. The __w__‐distance sum of a vertex __y__ is __D~G, w~(y)__ = σ~x≅v~ __d(y, x)w(x).__ The __w__‐median of __G__ is the set of all vertices __y__ with minimum __w__‐distanc