Contents

Ars Combinatoria

  • Research article

Weak Clique-Covering Cycles and Paths

G. Chen1, R. J. Faudree2, W. E. Shreve3
1Department of Mathematics Georgia State University Atlanta, GA 30303
2Department of Mathematical Sciences University of Memphis Memphis, TN 38152
3Department of Mathematics North Dakota State University Fargo, ND 58105
  • Published: 31/01/2001

Abstract

In this paper, we investigate the sufficient conditions for a graph to contain a cycle (path) \(C\) such that \(G\) – \(V(C)\) is a disjoint union of cliques. In particular, sufficient conditions involving degree sum and neighborhood union are obtained.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
G. Chen, R. J. Faudree, W. E. Shreve. Weak Clique-Covering Cycles and Paths[J], Ars Combinatoria, Volume 058. 67-83. DOI: .