Return to Article Details DECOMPOSITION OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS INTO COPIES OF P<sub>n</sub><sup>3</sup> or S<sub>2</sub>P<sub>n</sub><sup>3</sup> AND HARMONIOUS LABELING OF K<sub>2</sub>+ P<sub>n</sub> Download Download PDF