An algorithm for delta-wye reduction of almost-planar graphs

DOI10.1016/J.DAM.2020.06.024zbMATH Open1447.05195OpenAlexW3043761298MaRDI QIDQ2197481FDOQ2197481

Authors: Isidoro Gitler, Gustavo Sandoval-Angeles 

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.06.024

Recommendations

• Delta-wye transformations and the efficient reduction of almost-planar graphs
• Delta-wye reduction of almost-planar graphs
• On terminal delta-Wye reducibility of planar graphs
• On the delta-wye reduction for planar graphs
• Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs

zbMATH Keywords

crossing numberalmost-planar graphsdelta-wye reducibilitydelta-wye transformations

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Almost-graphic matroids
• Graph minors. XX: Wagner's conjecture
• Planar electric networks. II
• Title not available (Why is that?)
• The Use of Wye-Delta Transformations in Network Simplification
• On the number of spanning trees on various lattices
• Inverse problem in cylindrical electrical networks
• GENERALIZED SPIN MODELS
• Title not available (Why is that?)
• Optimization and Recognition for K 5-minor Free Graphs in Linear Time
• Stability, fragility, and Rota's conjecture
• On knot invariants related to some statistical mechanical models
• On terminal delta-Wye reducibility of planar graphs
• Forbidden minors for wye-delta-wye reducibility
• On the delta-wye reduction for planar graphs
• Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
• A Characterization of Almost-Planar Graphs
• Delta-wye reduction of almost-planar graphs
• Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
• Title not available (Why is that?)
• More forbidden minors for wye-delta-wye reducibility
• Circular planar electrical networks: posets and positivity
• Generalized generalized spin models (four-weight spin models)
• Do 3n − 5 edges force a subdivision ofK5?
• On almost-planar graphs
• Estimation of flows in flow networks
• Untangling planar curves
• A new approach to solving three combinatorial enumeration problems on planar graphs
• On topological spin models and generalized \(\Delta - Y\) transformations
• Lower bounds for electrical reduction on surfaces
• Tightening Curves on Surfaces Monotonically with Applications
• On the star—delta transformation in network reliability
• Four terminal planar Delta-Wye reducibility via rooted K_2,4 minors

Cited In (3)

• A degree preserving delta wye transformation with applications to 6-regular graphs and Feynman periods
• Delta-wye reduction of almost-planar graphs
• Delta-wye transformations and the efficient reduction of almost-planar graphs

This page was built for publication: An algorithm for delta-wye reduction of almost-planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197481)