$P_m\cup P_k$-equipackable Paths and Cycles

Abstract

A graph $G$ is called $H$-equipackable if every maximal $H$-packing in $G$ is also a maximum $H$-packing in $G$. In 2012, $P_k$-equipackable paths and cycles, $M_k$-equipackable paths and cycles are characterized. In this paper, $P_m\cup P_k$-equipackable paths and cycles are characterized.