Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give a linear time 4/3-approximation algorithm for the problem of finding the maximum number of vertex-disjoint paths of order 3 in subcubic graphs without pendant vertices, which improves previously known results [K. Kawarabayashi, H. Matsuda, Y. Oda, K. Ota, Path factors in cubic graphs, Journal of Graph Theory 39 (2002) 188-193; A. Kelmans, D. Mubayi, How many disjoint 2-edge paths must a cubic graph have?, Journal of Graph Theory 45 (2004) 57-79].
['Adrian Kosowski', 'Michał Małafiejski', 'Paweł Zyliński']
I am writing a research paper on a idea An approximation algorithm for maximum P 3 -packing in subcubic graphs
[{"from": "human", "value": "I am writing a research paper on a idea An approximation algorithm for maximum P 3 -packing in subcubic graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  give a linear time 4/3-approximation algorithm for the problem of finding the maximum number of vertex-disjoint paths of order 3 in subcubic graphs without pendant vertices, which improves previously known results [K. Kawarabayashi, H. Matsuda, Y. Oda, K. Ota, Path factors in cubic graphs, Journal of Graph Theory 39 (2002) 188-193; A. Kelmans, D. Mubayi, How many disjoint 2-edge paths must a cubic graph have?, Journal of Graph Theory 45 (2004) 57-79]."}]