Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
DOI<83::AID-JGT3>3.0.CO;2-P 10.1002/(SICI)1097-0118(200002)33:2<83::AID-JGT3>3.0.CO;2-PzbMath0946.05072OpenAlexW4250002096MaRDI QIDQ4946544
Charles J. Colbourn, Isidoro Gitler, J. Scott Provan, Dan S. Archdeacon
Publication date: 24 July 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200002)33:2<83::aid-jgt3>3.0.co;2-p
transformationdeltaterminalsprojective-planar graphsdegree-one reductionloop reductionseries reductionseries-parallel reduciblewyewye-delta-wye-reducible graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph minors (05C83)
Related Items (7)
Cites Work
- Unnamed Item
- On two dual classes of planar graphs
- The 2 and 3 representative projective planar embeddings
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- A new approach to solving three combinatorial enumeration problems on planar graphs
- Planar electric networks. II
- Generating projective plane polyhedral maps
- The Use of Wye-Delta Transformations in Network Simplification
- Cubic graphs with crossing number two
- On the delta-wye reduction for planar graphs
- Universality considerations in VLSI circuits
- A kuratowski theorem for the projective plane
- Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
- The Delta-Wye Approximation Procedure for Two-Terminal Reliability
- Computing the orientable genus of projective graphs
This page was built for publication: Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs