Delta-wye transformations and the efficient reduction of almost-planar graphs
From MaRDI portal
Recommendations
- Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
- Delta-wye reduction of almost-planar graphs
- An algorithm for delta-wye reduction of almost-planar graphs
- On the delta-wye reduction for planar graphs
- scientific article; zbMATH DE number 1990706
- On terminal delta-Wye reducibility of planar graphs
- Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
- On the planarity of some transformation graphs
- Graph Drawing
- Non-planar core reduction of graphs
Cited in
(9)- A new approach to solving three combinatorial enumeration problems on planar graphs
- An algorithm for delta-wye reduction of almost-planar graphs
- On the delta-wye reduction for planar graphs
- Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
- scientific article; zbMATH DE number 1990706 (Why is no real title available?)
- A Characterization of Almost-Planar Graphs
- Delta-wye reduction of almost-planar graphs
- Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
- Four terminal planar Delta-Wye reducibility via rooted K2,4 minors
This page was built for publication: Delta-wye transformations and the efficient reduction of almost-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413161)