Decomposing Cubic Graphs into Connected Subgraphs of Size Three - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Decomposing Cubic Graphs into Connected Subgraphs of Size Three

Résumé

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.
Fichier principal
Vignette du fichier
partitioning-cubic-graphs-arxiv.pdf (340.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01309152 , version 1 (28-04-2016)

Identifiants

Citer

Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu. Decomposing Cubic Graphs into Connected Subgraphs of Size Three. The 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨10.1007/978-3-319-42634-1_32⟩. ⟨hal-01309152⟩
286 Consultations
475 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More