✦ LIBER ✦

Combinatorial problems on series-parallel graphs

✍ Scribed by K. Takamizawa; T. Nishizeki; N. Saito

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 238 KB
Volume: 3
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(81)90031-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for combinatorial problems

Lower bounds for combinatorial problems on graphs

✍ Hiroyuki Nakayama; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 375 KB

A note on the tour problems in two-termi

A note on the tour problems in two-terminal series-parallel graphs

✍ Y.L. Wang; R.S. Chang; C.C. Hsu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 619 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

Earliest arrival flows on series-paralle

Earliest arrival flows on series-parallel graphs

✍ Stefan Ruzika; Heike Sperber; Mechthild Steiner 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

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