IJPAM: Volume 64, No. 2 (2010)
4-CYCLE COVERINGS OF THE COMPLETE GRAPH
WITH A HOLE
WITH A HOLE
Robert Gardner
, Scott LaVoie
, Chau Nguyen
Department of Mathematics and Statistics
East Tennessee State University
Johnson City, TN 36714, USA
e-mail: gardnerr@etsu.edu
Science Department
David Crockett High School
Jonesborough, TN 37659, USA
e-mail: lavoies@wcde.org
School of Pharmacy
University of Maryland
Balti more, MD 21201, USA
e-mail: chaunguyen283@gmail.com
, Scott LaVoie, Chau Nguyen
Department of Mathematics and Statistics
East Tennessee State University
Johnson City, TN 36714, USA
e-mail: gardnerr@etsu.edu
Science Department
David Crockett High School
Jonesborough, TN 37659, USA
e-mail: lavoies@wcde.org
School of Pharmacy
University of Maryland
Balti more, MD 21201, USA
e-mail: chaunguyen283@gmail.com
Abstract.Let 
denote the complete graph on 
vertices with a hole of size 
(i.e.,
). We give necessary and sufficient conditions for the existence of a minimum 4-cycle covering of .
Received: September 12, 2010
AMS Subject Classification: 05B40
Key Words and Phrases: graph decompositions, coverings, complete graphs with holes
Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2010
Volume: 64
Issue: 2