AUTHORS: Fan Wu, Yuqin Zhang
Download as PDF
ABSTRACT: A graph G is called H-equicoverable if every minimal H-covering of G is also a minimum H-covering of G. In this paper, we investigate the characterization of P5-equicoverable graphs which contain cycles with length at least 5 and give some results of Pk-equicoverable graphs.
KEYWORDS: P5-equicoverable, Pk-equicoverable, cycle, covering
REFERENCES:
[1] Y. Q. Zhang, P3-equicoverable graphs: Reasearch on H-equicoverable graphs. Discrete Applied Mathematics, Vol.156(5), 2008, pp. 647-661.
[2] S. Ruiz, Randomly decomposable graphs, Discrete Math,Vol.57(1/2), 1985, pp. 123-128.
[3] Y. Q. Zhang and Y. J. Sun, H-equipackable paths and cycles for H = P4 and H = M3, Ars Combinatoria, Vol.93, 2009, pp. 387-391.
[4] Y. Q. Zhang, W. H. Lan, Some special M2- equicoverable graphs(in Chinese), Journal of Tianjin University, Vol.42, 2009, pp. 83-85.
[5] L. D. Zhang, C. F. Zhou, Y.Q.Zhang, Two kinds of equicoverable paths and cycles, Ars Combinatoria, vol.118, 2015, pp. 109-118.
[6] Q.R. Wang, T.P. Shuai, W.B. Ai, J.H. Yuan, P4- equicoverable graphs which contains cycles with length at least 4 received by Discrete Mathematics, Algorithms and Applications.
