The structure of quasi 4-connected graphs

DOI10.1016/0012-365X(95)00229-PzbMath0870.05062OpenAlexW2068725754MaRDI QIDQ1356425

O. Diekmann

Publication date: 9 June 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00229-p

zbMATH Keywords

contractioncharacterizationpoint disconnecting setquasi 4-connected graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items

A result on quasi \(k\)-connected graphs, Removable edges in a 5-connected graph and a construction method of 5-connected graphs, Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs, Strengthened chain theorems for different versions of 4-connectivity, Generating internally four-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A classification of 4-connected graphs
• Minors of quasi 4-connected graphs
• Parallel concepts in graph theory
• A recursive characterization of the 4-connected graphs
• On minors of graphs with at least 3n −4 edges
• Kuratowski's theorem
• A forbidden minor characterization and reliability of a class of partial 4‐trees
• Minimally 2-connected graphs.
• On Minimal Blocks