✦ LIBER ✦

Arborescence polytopes for series-parallel graphs

✍ Scribed by Michel X. Goemans

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 887 KB
Volume: 51
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00035-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the stable set polytope of a series-p

On the stable set polytope of a series-parallel graph

✍ A. R. Mahjoub 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 204 KB

Colouring series-parallel graphs

✍ P. D. Seymour 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 634 KB

Equistable series–parallel graphs

✍ Ephraim Korach; Uri N. Peled 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev et al. about equistable out

On greedy algorithms for series parallel

On greedy algorithms for series parallel graphs

✍ Alan J. Hoffman 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 304 KB

Chromaticity of series-parallel graphs

✍ K.M. Koh; C.P. Teo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 454 KB

By applying a sequence of edge-gluings on a set of cycles each of length k, we obtain a special series-parallel graph. The well-known k-gon tree theorem (see [l, lo]) states that these graphs form a X-equivalence class. Many of the other known classes of X-unique graphs and X-equivalence classes are

A compact labeling scheme for series-par

A compact labeling scheme for series-parallel graphs

✍ George Steiner 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 731 KB