Decomposing subcubic graphs into claws, paths or triangles

[1]  Cristopher Moore,et al.  Hard Tiling Problems with Simple Tiles , 2001, Discret. Comput. Geom..

[2]  Éric Fusy,et al.  Transversal structures on triangulations: A combinatorial study and straight-line drawings , 2006, Discret. Math..

[3]  Ajit A. Diwan,et al.  The complexity of P4-decomposition of regular graphs and multigraphs , 2015, Discret. Math. Theor. Comput. Sci..

[4]  Xavier Muñoz,et al.  Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs , 2011, SIAM J. Discret. Math..

[5]  Odile Favaron,et al.  Regular path decompositions of odd regular graphs , 2010, J. Graph Theory.

[6]  Raphael Yuster,et al.  Combinatorial and computational aspects of graph packing and graph decomposition , 2007, Comput. Sci. Rev..

[7]  Guillaume Fertin,et al.  Decomposing Cubic Graphs into Connected Subgraphs of Size Three , 2016, COCOON.

[8]  Yoshiko Wakabayashi,et al.  Decompositions of triangle-free 5-regular graphs into paths of length five , 2015, Discret. Math..

[9]  Zbigniew Lonc,et al.  Polynomial cases of graph decomposition: A complete solution of Holyer's problem , 2009, Discret. Math..

[10]  Zbigniew Lonc.  Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial , 1997, J. Comb. Theory, Ser. B.

[11]  Martin E. Dyer,et al.  Planar 3DM is NP-Complete , 1986, J. Algorithms.

[12]  Ian Holyer,et al.  The NP-Completeness of Some Edge-Partition Problems , 1981, SIAM J. Comput..

[13]  Zbigniew Lonc,et al.  Edge decompositions into two kinds of graphs , 2009, Discret. Math..