On the structure of arbitrarily partitionable graphs with given connectivity

DOI10.1016/J.DAM.2013.09.007MaRDI QIDQ741769zbMATH OpenOpenAlexFDO

Authors Olivier Baudon, Florent Foucaud, Jakub Przybyło, 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

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

Recommendations

• Dense arbitrarily partitionable graphs
• More aspects of arbitrarily partitionable graphs
• Structural properties of recursively partitionable graphs with connectivity 2
• On minimal arbitrarily partitionable graphs
• Partitioning Harary graphs into connected subgraphs containing prescribed vertices

Cites work

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

Cited in

(15)

• Toughness of Recursively Partitionable Graphs
• scientific article; zbMATH DE number 3997833 (Why is no real title available?)
• More aspects of arbitrarily partitionable graphs
• Arbitrary partitionability of product graphs
• Some properties of minimal arbitrarily partitionable graphs
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Dense arbitrarily partitionable graphs
• Partitioning Harary graphs into connected subgraphs containing prescribed vertices
• Dense on-line arbitrarily partitionable graphs
• Arbitrarily edge-partitionable graphs
• A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
• On minimal arbitrarily partitionable graphs
• Structural properties of recursively partitionable graphs with connectivity 2
• Small dense on-line arbitrarily partitionable graphs
• Partitioning the Cartesian product of a tree and a cycle

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

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