Contents

Ars Combinatoria

  • Research article

\(P_m \cup P_k\)-equipackable Paths and Cycles

Liandi Zhang1, Yanfei Wang2, Yuqin Zhang2
1College of Science, Tianjin University of Commerce, Tianjin, 300134, China
2Department of Mathematics, Tianjin University, Tianjin, 300354, China
  • Published: 31/01/2017

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.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Liandi Zhang, Yanfei Wang, Yuqin Zhang. \(P_m \cup P_k\)-equipackable Paths and Cycles[J], Ars Combinatoria, Volume 130. 417-425. .