1989/06/01 by Klaus Truemper · 59 citations
Computer Science · Mathematics · #Cellular Automata and Applications #Interconnection Networks and Systems #Advanced Graph Theory Research #Mathematics #Planar graph #Combinatorics #Graph #Planar #Discrete mathematics #Reduction (mathematics) #Computer science #Geometry
paper · doi:10.1002/jgt.3190130202
published in Journal of Graph Theory 13(2), 141-148 (Wiley)
openalex publication_date 1989/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
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.