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.
%0 Journal Article
%1 truemper89
%A Truemper, K.
%D 1989
%I Wiley Subscription Services, Inc., A Wiley Company
%J Journal of Graph Theory
%K graph.theory kron planar
%N 2
%P 141--148
%R 10.1002/jgt.3190130202
%T On the Delta-Wye Reduction for Planar Graphs
%V 13
%X 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.
@article{truemper89,
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.},
added-at = {2016-05-22T08:53:33.000+0200},
author = {Truemper, K.},
biburl = {https://www.bibsonomy.org/bibtex/2beb827c0678be816e3150671aaf3aefe/ytyoun},
doi = {10.1002/jgt.3190130202},
interhash = {5cf7f011a56eb2a254c0d45443024ad0},
intrahash = {beb827c0678be816e3150671aaf3aefe},
issn = {1097-0118},
journal = {Journal of Graph Theory},
keywords = {graph.theory kron planar},
number = 2,
pages = {141--148},
publisher = {Wiley Subscription Services, Inc., A Wiley Company},
timestamp = {2016-05-22T09:15:41.000+0200},
title = {On the Delta-Wye Reduction for Planar Graphs},
volume = 13,
year = 1989
}