Decomposition of 3-connected graphs

DOI10.1007/BF01202787zbMath0788.05075OpenAlexW2079304030MaRDI QIDQ2367440

L. Leslie Gardner, Donald K. Wagner, Collette R. Coullard

Publication date: 16 August 1993

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202787

zbMATH Keywords

decompositionpolygonswheelsbonds3-connected graphsgood splittwirls

Mathematics Subject Classification ID

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

Related Items (1)

On the structure of 3-connected matroids and graphs

Cites Work

• Unnamed Item
• A decomposition theory for matroids. I: General results
• Minimally 3-connected graphs
• Decomposition of regular matroids
• A structural characterization of planar combinatorial graphs
• Minimal Cyclic-4-Connected Graphs
• A Combinatorial Decomposition Theory
• Non-Separable and Planar Graphs
• Halin graphs and the travelling salesman problem
• Dividing a Graph into Triconnected Components
• Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.

This page was built for publication: Decomposition of 3-connected graphs