✦ LIBER ✦

Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs

✍ Scribed by Archdeacon, Dan; Colbourn, Charles J.; Gitler, Isidoro; Provan, J. Scott

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 188 KB
Volume: 33
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(200002)33:2<83::aid-jgt3>3.0.co;2-p

No coin nor oath required. For personal study only.

✦ Synopsis

A graph is Y ∆Y -reducible if it can be reduced to a vertex by a sequence of series-parallel reductions and Y ∆Y -transformations. Terminals are dis-

📜 SIMILAR VOLUMES

On the delta-wye reduction for planar gr

On the delta-wye reduction for planar graphs

✍ K. Truemper 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB

We provide an elementary proof of an important theorem by G. V. Epifanov, according to which every two-terminal planar graph satisfying certain connectivity restrictions can by some sequence of series/parallel reductions and delta-wye exchanges be reduced to the graph consisting of the two terminals