4-Cycle Coverings of the Complete Graph With a Hole

Creator(s)

Robert Gardner, East Tennessee State UniversityFollow
Scott LaVoie, David Crockett High School
Chau Nguyen, University of Maryland, Baltimore

Document Type

Article

Publication Date

12-10-2010

Description

Let K(v,w) denote the complete graph on v vertices with a hole of size w (i.e., K(v, w) = Kv\Kw). We give necessary and sufficient conditions for the existence of a minimum 4-cycle covering of K (v,w).

Citation Information

Gardner, Robert; LaVoie, Scott; and Nguyen, Chau. 2010. 4-Cycle Coverings of the Complete Graph With a Hole. International Journal of Pure and Applied Mathematics. Vol.64(2). 317-330. ISSN: 1311-8080