Partitioning a k-connected graph

DOI10.1515/156939205774464918zbMATH Open1079.05078OpenAlexW4255098216MaRDI QIDQ5704313

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

partitionsboundparts

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Related Items (5)

Partitioning ℝ^<em>n</em> into Connected Components ⋮ On partitioning a graph into two connected subgraphs ⋮ Partitioning a graph into minimum gap components ⋮ On the complexity of partitioning graphs into connected subgraphs ⋮ Finding the closed partition of a planar graph

Uses Software

• Title not available (Why is that?)

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)