On the delta‐wye reduction for planar graphs
Klaus Truemper · Journal of Graph Theory · 1989
Abstract 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 and just one edge.