Partitioning a k-connected graph

DOI10.1515/156939205774464918MaRDI QIDQ5704313zbMATH OpenOpenAlexFDO

Authors Yu. M. Lifshits

Publication date 14 November 2005

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939205774464918

zbMATH Keywords

boundpartitionsparts

Mathematics Subject Classification ID

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

Recommendations

• An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
• Judicious partitions of graphs
• Partitioning a graph into highly connected subgraphs
• On partitioning the edges of graphs into connected subgraphs
• Partitions of graphs with high minimum degree or connectivity.

Cited in

(7)

• On the complexity of partitioning graphs into connected subgraphs
• Finding the closed partition of a planar graph
• Partitioning a graph into highly connected subgraphs
• Partitioning ℝ^<em>n</em> into Connected Components
• scientific article; zbMATH DE number 3963885 (Why is no real title available?)
• Partitioning a graph into minimum gap components
• On partitioning a graph into two connected subgraphs

Describes a project that uses

Uses Software

• APL

This page was built for publication: Partitioning a k-connected graph

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