On two dual classes of planar graphs

DOI10.1016/0012-365X(90)90293-QzbMath0704.05042OpenAlexW1997601296MaRDI QIDQ916681

Ehab S. El-Mallah, Charles J. Colbourn

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90293-q

zbMATH Keywords

dualityplanar graphslinear time recognitiondelta wye reducibilityForbidden minors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items

A new approach to solving three combinatorial enumeration problems on planar graphs ⋮ Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs ⋮ Three ways to cover a graph ⋮ Graph product structure for non-minor-closed classes ⋮ On the bend-number of planar and outerplanar graphs

Cites Work

• Forbidden minors characterization of partial 3-trees
• Parallel concepts in graph theory
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• The Use of Wye-Delta Transformations in Network Simplification
• Steiner trees, partial 2–trees, and minimum IFI networks
• Characterization and Recognition of Partial 3-Trees
• Linear-time computability of combinatorial problems on series-parallel graphs
• Efficient Planarity Testing
• Wye-Delta Transformation in Probablilistic Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item