Minors of quasi 4-connected graphs
type: Item
instance of: scholarly article
title: Minors of quasi 4-connected graphs
zbMATH Open document ID: 0808.05082
DOI: 10.1016/0012-365X(94)90269-0
author: V. Pereyra
published in: Discrete Mathematics
publication date: 1994-04-04T00:00:00Z
review text: A quasi 4-connected graph is a 3-connected graph with no nontrivial 3- separators. Herein a nontrivial 3-separator is a minimal point disconnecting set \(S\) of cardinality 3 such that the connected components of \(G-S\) can be partitioned into two sets both with at least two points. Some results on minors of quasi 4-connected graphs are proved, which have some well-known results as corollaries.
reviewed by: Peter Kirschenhofer
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 540941
zbMATH Keywords: 4-connected graph
zbMATH Keywords: 3-separator
zbMATH Keywords: minors
MaRDI profile type: Publication
cites work: Forbidden minors characterization of partial 3-trees
cites work: Q3852212
cites work: Über einen Satz von K.Wagner zum Vierfarbenproblem
cites work: Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
cites work: Parallel concepts in graph theory
cites work: Q5581642
cites work: Q5528475
cites work: A characterization of partial 3-trees
full work available at URL: 0012-365x(94)90269-0
OpenAlex ID: W2083869053
description: scientific article; zbMATH DE number 540941