The decomposition of graphs into k-connected components

DOI10.1016/0012-365X(92)90284-MzbMATH Open0778.05063WikidataQ126351165 ScholiaQ126351165MaRDI QIDQ686294FDOQ686294

Authors: Walter Hohberg 

Publication date: 14 October 1993

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel concepts in graph theory
• A Combinatorial Decomposition Theory
• Dividing a Graph into Triconnected Components
• A structural characterization of planar combinatorial graphs
• Title not available (Why is that?)

Cited In (27)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Blocks in \(k\)-connected graphs
• 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
• To Approximate Treewidth, Use Treelength!
• Title not available (Why is that?)
• On the decomposition of a 3-connected graph into cyclically 4-edge-connected components
• 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
• Numerical assessment of delamination in fibre metal laminates
• \(n\)-particle quantum statistics on graphs
• Decomposing infinite 2-connected graphs into 3-connected components
• Title not available (Why is that?)
• Why should biconnected components be identified first
• Title not available (Why is that?)
• 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)