The decomposition of graphs into k-connected components

DOI10.1016/0012-365X(92)90284-MMaRDI QIDQ686294zbMATH OpenWikidataFDO

Authors Walter Hohberg

Publication date 14 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(92)90284-M

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)

Recommendations

• Blocks in \(k\)-connected graphs
• scientific article; zbMATH DE number 1960407
• \(k\)-connectivity and decomposition of graphs into forests
• scientific article; zbMATH DE number 512929
• Decomposing infinite 2-connected graphs into 3-connected components

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 49212 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• A Combinatorial Decomposition Theory
• A structural characterization of planar combinatorial graphs
• Dividing a Graph into Triconnected Components
• Parallel concepts in graph theory

Cited in

(29)

• scientific article; zbMATH DE number 5008680 (Why is no real title available?)
• Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
• scientific article; zbMATH DE number 1210717 (Why is no real title available?)
• scientific article; zbMATH DE number 6667026 (Why is no real title available?)
• Blocks in \(k\)-connected graphs
• scientific article; zbMATH DE number 7132828 (Why is no real title available?)
• Large contractible subgraphs of a 3-connected graph
• Deleting vertices from a 2-connected graph with preserving 2-connectedness
• On critical 3-connected graphs with two vertices of degree 3. I
• Generalized flowers in \(k\)-connected graphs
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On the decomposition of a 3-connected graph into cyclically 4-edge-connected components
• scientific article; zbMATH DE number 2094440 (Why is no real title available?)
• The structure of a decomposition of a triconnected graph
• Generalized flowers in \(k\)-connected graphs. II
• Minimal biconnected graphs
• The decomposition tree of a biconnected graph
• The complexity of broadcasting in planar and decomposable graphs
• On vertices of degree 6 of minimal and contraction critical 6-connected graph
• Connect four and graph decomposition
• Numerical assessment of delamination in fibre metal laminates
• To approximate treewidth, use treelength!
• \(n\)-particle quantum statistics on graphs
• Decomposing infinite 2-connected graphs into 3-connected components
• scientific article; zbMATH DE number 475619 (Why is no real title available?)
• Why should biconnected components be identified first
• scientific article; zbMATH DE number 3981211 (Why is no real title available?)
• scientific article; zbMATH DE number 49212 (Why is no real title available?)
• On critical 3-connected graphs with two vertices of degree 3. II

This page was built for publication: The decomposition of graphs into \(k\)-connected components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686294)