# Decomposing Cubic Graphs into Connected Subgraphs of Size Three

@article{Bulteau2016DecomposingCG, title={Decomposing Cubic Graphs into Connected Subgraphs of Size Three}, author={Laurent Bulteau and Guillaume Fertin and Anthony Labarre and Romeo Rizzi and Irena Rusu}, journal={ArXiv}, year={2016}, volume={abs/1604.08603} }

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… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 12 REFERENCES

## On the complexity of partitioning graphs into connected subgraphs

VIEW 13 EXCERPTS

HIGHLY INFLUENTIAL

## Hard Tiling Problems with Simple Tiles

VIEW 1 EXCERPT

## Trois Types De Décompositions D'un Graphe En Chaînes

VIEW 2 EXCERPTS

## The NP-Completeness of Some Edge-Partition Problems

VIEW 3 EXCERPTS