Competition hypergraphs of digraphs with certain properties II. Hamiltonicity | Zendy

Martin Sonntag | Zendy; HannsMartin Teichert | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Competition hypergraphs of digraphs with certain properties II. Hamiltonicity

Author(s) -

Martin Sonntag,

HannsMartin Teichert

Publication year - 2008

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1389

Subject(s) - combinatorics , mathematics , digraph , hypergraph , vertex (graph theory) , hamiltonian path , hamiltonian (control theory) , discrete mathematics , graph , mathematical optimization

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research