Minors of quasi 4-connected graphs

DOI10.1016/0012-365X(94)90269-0zbMath0808.05082OpenAlexW2083869053MaRDI QIDQ1318814

V. Pereyra

Publication date: 4 April 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90269-0

zbMATH Keywords

minors4-connected graph3-separator

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (5)

The structure of quasi 4-connected graphs ⋮ 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 ⋮ A Characterization of Graphs with No Octahedron Minor

Cites Work

• Forbidden minors characterization of partial 3-trees
• Parallel concepts in graph theory
• Über einen Satz von K.Wagner zum Vierfarbenproblem
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
• A characterization of partial 3-trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minors of quasi 4-connected graphs