Return to search

4-Cycle Coverings of the Complete Graph With a Hole

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).

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-18190
Date10 December 2010
CreatorsGardner, Robert, LaVoie, Scott, Nguyen, Chau
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.0065 seconds