Interplays between variations of arbitrarily partitionable graphs under minimality constraints

DOI10.1016/J.AMC.2024.128753MaRDI QIDQ6571005zbMATH OpenFDO

Authors Olivier Baudon, Julien Bensmail, Morgan Boivin

Publication date 11 July 2024

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2024.128753

zbMATH Keywords

minimalityarbitrarily partitionable graphonline arbitrarily partitionable graphrecursively arbitrarily partitionable graphpartition into connected subgraphs

Mathematics Subject Classification ID

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

Recommendations

• Some properties of minimal arbitrarily partitionable graphs
• On minimal arbitrarily partitionable graphs
• More aspects of arbitrarily partitionable graphs
• Structural properties of recursively partitionable graphs with connectivity 2
• Arbitrarily edge-partitionable graphs

Cites work

• scientific article; zbMATH DE number 5238175 (Why is no real title available?)
• A degree bound on decomposable trees
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Arbitrarily vertex decomposable suns with few rays
• Decomposable trees: A polynomial algorithm for tripodes
• Dense arbitrarily partitionable graphs
• Dense arbitrarily vertex decomposable graphs
• Dense on-line arbitrarily partitionable graphs
• More aspects of arbitrarily partitionable graphs
• Note on Hamilton Circuits
• On arbitrarily vertex decomposable trees
• On minimal arbitrarily partitionable graphs
• On-line arbitrarily vertex decomposable suns
• On-line arbitrarily vertex decomposable trees
• Recursively arbitrarily vertex-decomposable graphs
• Recursively arbitrarily vertex-decomposable suns
• Small dense on-line arbitrarily partitionable graphs
• Some properties of minimal arbitrarily partitionable graphs

Cited in

(1)

• Some properties of minimal arbitrarily partitionable graphs

This page was built for publication: Interplays between variations of arbitrarily partitionable graphs under minimality constraints

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