Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
Martin Sonntag, Hanns‐Martin Teichert · Discussiones Mathematicae Graph Theory · 2008
If D = (V; A) is a digraph, its competition hypergraph CH(D) has vertex set V and e V is an edge of CH(D) i jej 2 and there is a vertex v 2 V , such that e = N D (v) = fw 2 V j(w; v) 2 Ag. We give characterizations of CH(D) in case of hamiltonian digraphs D and, more general, of digraphs D having a -cycle factor. The results are closely related to the corresponding investigations for competition graphs in Fraughnaugh et al. [4] and Guichard [6].