Decomposing Cubic Graphs into Connected Subgraphs of Size Three

Autor:	Bulteau, Laurent, Fertin, Guillaume, Labarre, Anthony, Rizzi, Romeo, Rusu, Irena
Rok vydání:	2016
Předmět:	Computer Science - Data Structures and Algorithms Mathematics - Combinatorics
Druh dokumentu:	Working Paper
DOI:	10.1007/978-3-319-42634-1_32
Popis:	Let $S=\{K_{1,3},K_3,P_4\}$ 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'\subseteq 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. Comment: to appear in the proceedings of COCOON 2016
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1604.08603 Zobrazit plný text záznamu View this record from Arxiv