The decomposition of graphs into \(k\)-connected components

DOI10.1016/0012-365X(92)90284-MzbMath0778.05063WikidataQ126351165 ScholiaQ126351165MaRDI QIDQ686294

Walter Hohberg

Publication date: 14 October 1993

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

zbMATH Keywords

decomposition\(k\)-connected components

Mathematics Subject Classification ID

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

Related Items

Deleting vertices from a 2-connected graph with preserving 2-connectedness ⋮ On critical 3-connected graphs with two vertices of degree 3. I ⋮ On the decomposition of a 3-connected graph into cyclically 4-edge-connected components ⋮ Generalized flowers in \(k\)-connected graphs ⋮ The structure of a decomposition of a triconnected graph ⋮ The complexity of broadcasting in planar and decomposable graphs ⋮ Generalized flowers in \(k\)-connected graphs. II ⋮ The decomposition tree of a biconnected graph ⋮ Minimal biconnected graphs ⋮ On critical 3-connected graphs with two vertices of degree 3. II ⋮ Large contractible subgraphs of a 3-connected graph ⋮ Unnamed Item ⋮ To Approximate Treewidth, Use Treelength! ⋮ On vertices of degree 6 of minimal and contraction critical 6-connected graph ⋮ \(n\)-particle quantum statistics on graphs ⋮ Numerical assessment of delamination in fibre metal laminates ⋮ Blocks in \(k\)-connected graphs

Cites Work

• Parallel concepts in graph theory
• A structural characterization of planar combinatorial graphs
• A Combinatorial Decomposition Theory
• Dividing a Graph into Triconnected Components
• Unnamed Item
• Unnamed Item
• Unnamed Item