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

Journal of Graph Theory

Volumn 33, Issue 2, 2000, Pages 83-93

  Archdeacon, Dan ^a   Colbourn, Charles J ^a   Gitler, Isidoro ^b   Provan, J Scott ^c  

^a University of Vermont ^*  (United States)

^b DEPARTAMENTO DE FÍSICA   (Mexico)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Reducible graphs; Terminal; Wye delta

Indexed keywords

EID: 0034407452     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(200002)33:2<83::AID-JGT3>3.0.CO;2-P     Document Type: Article

References (29)

1. S. B. Akers Jr., The use of wye-delta transformations in network simplification, Oper Res 8 (1960), 311-323.
2. D. S. Archdeacon, A Kuratowski theorem for the projective plane, J Graph Theory 5 (1981), 243-246.
3. D. W. Barnette, Generating projective plane polyhedral maps, J Combin Theory B 51 (1991), 277-291.
4. M. K. Chari, T. A. Feo, and J. S. Provan, The delta-wye approximation procedure for two-terminal reliability, Oper Res 44 (1996), 745-755.
5. C. J. Colbourn, The combinatorics of network reliability, Oxford University Press, New York, 1987.
6. C. J. Colbourn, J. S. Provan, and D. Vertigan, A new approach to solving three combinatorial enumeration problems on planar graphs, ARIDAM VI and VII (New Brunswick, NJ, 1991/1992), Discrete Appl Math 60 (1995), 119-129.
7. Y. Colin de Verdiére, I. Gitler, and D. Vertigan, Reseaux électriques planaires II, Comment Math Helvetici 71 (1996), 144-167.
8. E. S. Elmallah and C. J. Colbourn, On two dual classes of planar graphs, Discrete Math 80 (1990), 21-40.
9. G. V. Epifanov, Reduction of a plane graph to an edge by a star-triangle transformation, Soviet Math Doklady 166 (1966), 13-17.
10. T. A. Feo, Efficient reduction of planar networks for solving certain combinatorial problems, Univ Calif Berkeley, preprint, 1985.
11. T. A. Feo and J. S. Provan, Delta-wye transformations and the efficient reduction of two-terminal planar graphs, Oper Res 41 (1993), 572-582.
12. J. Fiedler, J. P. Huneke, R. B. Richter, and N. Robertson, Computing the orientable genus of projective graphs, J Graph Theory 20 (1995), 297-308.
13. I. Gitler, Delta-wye-delta transformations-algorithms and applications, Ph.D. Thesis, Univ Waterloo, 1991.
14. 3 by Δ - Y Transformations, preprint, Univ Waterloo, 1991.
15. B. Grünbaum. Convex polytopes. Interscience, London, 1967.
16. F. Jaeger, On the Kauffman polynomial of planar matroids, Fourth Czech Symp Combin, Graphs Complexity (Prachatice, 1990), North-Holland, Amsterdam, Ann Discrete Math 51 (1992), 117-127.
17. F. Jaeger, On the Kauffman polynomial of planar matroids, Fourth Czech Symp Combin, Graphs Complexity (Prachatice, 1990), North-Holland, Amsterdam, Ann Discrete Math 51 (1992), 117-127.
18. A. B. Lehman, Wye-delta transformations in probabilistic networks, J SIAM 11 (1962), 773-805.
19. B. Richter, Cubic graphs with crossing number two, J Graph Theory 12 (1988), 363-374.
20. N. Robertson and R. Vitray, "Representativity of surface embeddings," Paths, flows, and VLSI-layout, B. Korte, L. Lovasz, H. Prömel, A. Schrijver (Editors), Springer-Verlag, 1990.
21. N. Robertson and P. D. Seymour, Graph minors XX: Wagner's Conjecture, preprint, 1988.
22. K. Truemper, On the delta-wye reduction for planar graphs, J Graph Theory 13 (1989), 141-148.
23. K. Truemper, A decomposition theory for matroids VI: Almost regular matroids, J Combin Theory Ser B 55 (1992), 235-301.
24. K. Truemper, A decomposition theory for matroids VII: Analysis of minimal violation matrices, J Combin Theory B 55 (1992), 302-335.
25. K. Truemper, Matroid decomposition, Academic, Boston, 1992.
26. L. G. Valiant, Universality considerations in VLSI circuits, IEEE Transact Comp 30 (1981), 135-140.
27. R. Vitray, 2 and 3 representative projective planar embeddings, J Combin Theory B 54 (1992), 1-12.
28. H. M. K. Warkentyne, Δ - Y reduction, M. Math. Thesis, Univ Waterloo, 1988.
29. W. T. Tutte, "Graph theory," Encyclopedia of mathematics and its applications, Volume 21, Addison Wesley, Menlo Park, California, 1984.