On the structure of arbitrarily partitionable graphs with given connectivity

DOI10.1016/j.dam.2013.09.007zbMath1300.05245OpenAlexW2053743718MaRDI QIDQ741769

Florent Foucaud, Jakub Przybyło, Olivier Baudon, Mariusz Woźniak

Publication date: 12 September 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.007

zbMATH Keywords

connectivityarbitrarily partitionable

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (6)

Dense arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ On minimal arbitrarily partitionable graphs ⋮ Structural properties of recursively partitionable graphs with connectivity 2 ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

Cites Work

• Structural properties of recursively partitionable graphs with connectivity 2
• On-line arbitrarily vertex decomposable trees
• A degree bound on decomposable trees
• Recursively arbitrarily vertex-decomposable graphs

This page was built for publication: On the structure of arbitrarily partitionable graphs with given connectivity