Two Kinds of 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 2009, $P_4$-equipackable paths and cycles, $M_3$-equipackable paths and cycles have been characterized. In this paper, $P_k$-equipackable paths and cycles, $M_k$-equipackable paths and cycles are characterized.