On two dual classes of planar graphs

Ehab S. El-Mallah, Charles Colbourn

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

A planar graph G is delta-wye "Δ-Y" reducible if G can be reduced to an edge by a sequence of Δ-Y, series, parallel and degree-1 reductions. Politof characterizes Δ-Y reducible graphs in terms of forbidden homeomorphic subgraphs. A wye-delta "Y-Δ" reducible graph is one that can be reduced to an edge by a sequence of Y-Δ, series, parallel and degree-1 reductions. Y-Δ reducible graphs are all partial 3-trees. Recently, Arnborg and Proskurowski have shown confluent reductions which are both necessary and sufficient for the recognition of partial 3-trees. In this paper we note that Δ-Y graphs are the planar duals of Y-Δ graphs. We exploit this duality and the known reduction rules for partial 3-trees to characterize both classes of graphs using forbidden minors. The result yields a shorter proof of Politof's result. In addition, we give linear time algorithms for recognizing such graphs and for embedding any Δ-Y graph in a 4-tree. These algorithms complement many known linear time algorithms for solving some hard network problems on graphs given their embedding in a k-tree for some fixed k.

Original languageEnglish (US)
Pages (from-to)21-40
Number of pages20
JournalDiscrete Mathematics
Volume80
Issue number1
DOIs
StatePublished - Feb 15 1990
Externally publishedYes

Fingerprint

Planar graph
Graph in graph theory
Linear-time Algorithm
Partial
Forbidden Minor
Graph Minors
K-tree
Series
Class
Homeomorphic
Subgraph
Duality
Complement
Sufficient
Necessary

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On two dual classes of planar graphs. / El-Mallah, Ehab S.; Colbourn, Charles.

In: Discrete Mathematics, Vol. 80, No. 1, 15.02.1990, p. 21-40.

Research output: Contribution to journalArticle

El-Mallah, Ehab S. ; Colbourn, Charles. / On two dual classes of planar graphs. In: Discrete Mathematics. 1990 ; Vol. 80, No. 1. pp. 21-40.
@article{a8780186570146afa444b54419359ab6,
title = "On two dual classes of planar graphs",
abstract = "A planar graph G is delta-wye {"}Δ-Y{"} reducible if G can be reduced to an edge by a sequence of Δ-Y, series, parallel and degree-1 reductions. Politof characterizes Δ-Y reducible graphs in terms of forbidden homeomorphic subgraphs. A wye-delta {"}Y-Δ{"} reducible graph is one that can be reduced to an edge by a sequence of Y-Δ, series, parallel and degree-1 reductions. Y-Δ reducible graphs are all partial 3-trees. Recently, Arnborg and Proskurowski have shown confluent reductions which are both necessary and sufficient for the recognition of partial 3-trees. In this paper we note that Δ-Y graphs are the planar duals of Y-Δ graphs. We exploit this duality and the known reduction rules for partial 3-trees to characterize both classes of graphs using forbidden minors. The result yields a shorter proof of Politof's result. In addition, we give linear time algorithms for recognizing such graphs and for embedding any Δ-Y graph in a 4-tree. These algorithms complement many known linear time algorithms for solving some hard network problems on graphs given their embedding in a k-tree for some fixed k.",
author = "El-Mallah, {Ehab S.} and Charles Colbourn",
year = "1990",
month = "2",
day = "15",
doi = "10.1016/0012-365X(90)90293-Q",
language = "English (US)",
volume = "80",
pages = "21--40",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - On two dual classes of planar graphs

AU - El-Mallah, Ehab S.

AU - Colbourn, Charles

PY - 1990/2/15

Y1 - 1990/2/15

N2 - A planar graph G is delta-wye "Δ-Y" reducible if G can be reduced to an edge by a sequence of Δ-Y, series, parallel and degree-1 reductions. Politof characterizes Δ-Y reducible graphs in terms of forbidden homeomorphic subgraphs. A wye-delta "Y-Δ" reducible graph is one that can be reduced to an edge by a sequence of Y-Δ, series, parallel and degree-1 reductions. Y-Δ reducible graphs are all partial 3-trees. Recently, Arnborg and Proskurowski have shown confluent reductions which are both necessary and sufficient for the recognition of partial 3-trees. In this paper we note that Δ-Y graphs are the planar duals of Y-Δ graphs. We exploit this duality and the known reduction rules for partial 3-trees to characterize both classes of graphs using forbidden minors. The result yields a shorter proof of Politof's result. In addition, we give linear time algorithms for recognizing such graphs and for embedding any Δ-Y graph in a 4-tree. These algorithms complement many known linear time algorithms for solving some hard network problems on graphs given their embedding in a k-tree for some fixed k.

AB - A planar graph G is delta-wye "Δ-Y" reducible if G can be reduced to an edge by a sequence of Δ-Y, series, parallel and degree-1 reductions. Politof characterizes Δ-Y reducible graphs in terms of forbidden homeomorphic subgraphs. A wye-delta "Y-Δ" reducible graph is one that can be reduced to an edge by a sequence of Y-Δ, series, parallel and degree-1 reductions. Y-Δ reducible graphs are all partial 3-trees. Recently, Arnborg and Proskurowski have shown confluent reductions which are both necessary and sufficient for the recognition of partial 3-trees. In this paper we note that Δ-Y graphs are the planar duals of Y-Δ graphs. We exploit this duality and the known reduction rules for partial 3-trees to characterize both classes of graphs using forbidden minors. The result yields a shorter proof of Politof's result. In addition, we give linear time algorithms for recognizing such graphs and for embedding any Δ-Y graph in a 4-tree. These algorithms complement many known linear time algorithms for solving some hard network problems on graphs given their embedding in a k-tree for some fixed k.

UR - http://www.scopus.com/inward/record.url?scp=38249020050&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249020050&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(90)90293-Q

DO - 10.1016/0012-365X(90)90293-Q

M3 - Article

AN - SCOPUS:38249020050

VL - 80

SP - 21

EP - 40

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -