Advertisement

Decomposing Cubic Graphs into Connected Subgraphs of Size Three

  • Laurent Bulteau
  • Guillaume Fertin
  • Anthony LabarreEmail author
  • Romeo Rizzi
  • Irena Rusu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9797)

Abstract

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.

References

  1. 1.
    Bouchet, A., Fouquet, J.-L. Trois types de décompositions d’un graphe en chaénes. In: Berge, C., Bresson, D., Camion, P., Maurras, J.F., Sterboul, F. (eds.) Combinatorial Mathematics: Proceedings of the International Colloquium on Graph Theory and Combinatorics. North-Holland Mathematics Studies, vol. 75, pp. 131–141, North-Holland (1983)Google Scholar
  2. 2.
    Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial Mathematics (1987)Google Scholar
  3. 3.
    Dor, D., Tarsi, M.: Graph decomposition is NP-complete: a complete proof of Holyer’s conjecture. SIAM J. Comput. 26, 1166–1187 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Dyer, M.E., Frieze, A.M.: On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math. 10, 139–153 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fusy, É.: Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discrete Math. 309, 1870–1894 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Holyer, I.: The NP-completeness of some edge-partition problems. SIAM J. Comput. 10, 713–717 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kirkman, T.P.: On a problem in combinatorics. Camb. Dublin Math. J. 2, 191–204 (1847)Google Scholar
  8. 8.
    Kotzig, A.: Z teorie konečných pravidelných grafov tretieho a štvrtého stupňa, Časopis pro pěstování matematiky, pp. 76–92 (1957)Google Scholar
  9. 9.
    Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26, 573–590 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Muñoz, X., Li, Z., Sau, I.: Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs. SIAM J. Discrete Math. 25, 1490–1505 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Yuster, R.: Combinatorial and computational aspects of graph packing and graph decomposition. Comput. Sci. Rev. 1, 12–26 (2007)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Laurent Bulteau
    • 1
  • Guillaume Fertin
    • 2
  • Anthony Labarre
    • 1
    Email author
  • Romeo Rizzi
    • 3
  • Irena Rusu
    • 2
  1. 1.Université Paris-Est, LIGM (UMR 8049), CNRS, ENPC, ESIEE Paris, UPEMMarne-la-ValléeFrance
  2. 2.Laboratoire d’Informatique de Nantes-Atlantique, UMR CNRS 6241Université de NantesNantes Cedex 3France
  3. 3.Department of Computer ScienceUniversity of VeronaVeronaItaly

Personalised recommendations