Abstract
Let S = {K1,3,K3, P4} be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph G into graphs taken from any non-empty S′ ⊆ S. The problem is known to be NP-complete for any possible choice of S′ in general graphs. In this paper, we assume that the input graph is cubic, and study the computational complexity of the problem of partitioning its edge set for any choice of S′. We identify all polynomial and NP-complete problems in that setting, and give graph-theoretic characterisations of S′-decomposable cubic graphs in some cases.
Cite
CITATION STYLE
Bulteau, L., Fertin, G., Labarre, A., Rizzi, R., & Rusu, I. (2016). Decomposing cubic graphs into connected subgraphs of size three. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9797, pp. 393–404). Springer Verlag. https://doi.org/10.1007/978-3-319-42634-1_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
