On three polynomial kernels of sequences for arbitrarily partitionable graphs

DOI10.1016/J.DAM.2015.08.016zbMath1330.05121OpenAlexW1420855114MaRDI QIDQ5962512

Julien Bensmail

Publication date: 12 February 2016

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

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

zbMATH Keywords

arbitrarily partitionable graphkernel of sequences

Mathematics Subject Classification ID

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

Related Items (2)

More aspects of arbitrarily partitionable graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning powers of traceable or Hamiltonian graphs
• On the complexity of partitioning graphs into connected subgraphs
• Decomposable trees: A polynomial algorithm for tripodes
• Dense arbitrarily vertex decomposable graphs
• Fully decomposable split graphs
• On the complexity of partitioning a graph into a few connected subgraphs
• A degree bound on decomposable trees
• Paths, Trees, and Flowers

This page was built for publication: On three polynomial kernels of sequences for arbitrarily partitionable graphs