4-Cycle Coverings of the Complete Graph With a Hole

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

This document is currently not available here.

Share

COinS