Arbitrarily edge-partitionable graphs

DOI10.1016/J.DAM.2024.09.033MaRDI QIDQ6648283zbMATH OpenFDO

Authors Julien Bensmail

Publication date 4 December 2024

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

Full work available at URL https://doi.org/10.1016/J.DAM.2024.09.033

zbMATH Keywords

arbitrarily partitionable graphline graphpartition into connected graphs

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• More aspects of arbitrarily partitionable graphs
• Some properties of minimal arbitrarily partitionable graphs
• Dense arbitrarily partitionable graphs
• On minimal arbitrarily partitionable graphs
• On the structure of arbitrarily partitionable graphs with given connectivity

Cites work

• A degree bound on decomposable trees
• A homology theory for spanning tress of a graph
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Decomposable trees: A polynomial algorithm for tripodes
• Decomposing graphs into a constant number of locally irregular subgraphs
• Decomposing trees with large diameter
• Dense arbitrarily partitionable graphs
• Dense arbitrarily vertex decomposable graphs
• Fully decomposable split graphs
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• scientific article; zbMATH DE number 5238175 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• More aspects of arbitrarily partitionable graphs
• Note on Hamilton Circuits
• On arbitrarily vertex decomposable trees
• On minimal arbitrarily partitionable graphs
• On the complexity of partitioning a graph into a few connected subgraphs
• On the complexity of partitioning graphs into connected subgraphs
• On the structure of arbitrarily partitionable graphs with given connectivity
• On three polynomial kernels of sequences for arbitrarily partitionable graphs
• Some properties of minimal arbitrarily partitionable graphs
• The edge Hamiltonian path problem is NP-complete

Cited in

(3)

• Some properties of minimal arbitrarily partitionable graphs
• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• Partitioning vertices and edges of graphs into connected subgraphs

This page was built for publication: Arbitrarily edge-partitionable graphs

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