More forbidden minors for wye-delta-wye reducibility
type: Item
instance of: scholarly article
title: More forbidden minors for wye-delta-wye reducibility
zbMATH Open document ID: 1080.05080
author: Yaming Yu
published in: The Electronic Journal of Combinatorics
publication date: 2006-01-31T00:00:00Z
full work available at URL: https://eudml.org/doc/125524
full work available at URL: v13i1r7.html
review text: Summary: A graph is \(Y\Delta Y\) reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and \(Y \Delta Y\) transformations. It is still an open problem to characterize \(Y \Delta Y\) reducible graphs in terms of a finite set of forbidden minors. We obtain a characterization of such forbidden minors that can be written as clique \(k\)-sums for \(k=1,2,3\). As a result we show constructively that the total number of forbidden minors is more than 68 billion up to isomorphism.
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 5002940
zbMATH Keywords: series-parallel reductions
zbMATH Keywords: transformations
zbMATH Keywords: characterization
describes a project that uses: nauty
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5002940