Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 1, pp. 23-34
Voir la notice de l'article provenant de la source Library of Science
If D = (V,A) is a digraph, its competition hypergraph (D) has vertex set V and e ⊆ V is an edge of (D) iff |e| ≥ 2 and there is a vertex v ∈ V, such that e = N_D⁻(v) = w ∈ V|(w,v) ∈ A. We give characterizations of (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].
Keywords:
hypergraph, competition graph, hamiltonian digraph
@article{DMGT_2008_28_1_a1,
author = {Sonntag, Martin and Teichert, Hanns-Martin},
title = {Competition hypergraphs of digraphs with certain properties {II.} {Hamiltonicity}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {23--34},
publisher = {mathdoc},
volume = {28},
number = {1},
year = {2008},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a1/}
}
TY - JOUR AU - Sonntag, Martin AU - Teichert, Hanns-Martin TI - Competition hypergraphs of digraphs with certain properties II. Hamiltonicity JO - Discussiones Mathematicae. Graph Theory PY - 2008 SP - 23 EP - 34 VL - 28 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a1/ LA - en ID - DMGT_2008_28_1_a1 ER -
%0 Journal Article %A Sonntag, Martin %A Teichert, Hanns-Martin %T Competition hypergraphs of digraphs with certain properties II. Hamiltonicity %J Discussiones Mathematicae. Graph Theory %D 2008 %P 23-34 %V 28 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a1/ %G en %F DMGT_2008_28_1_a1
Sonntag, Martin; Teichert, Hanns-Martin. Competition hypergraphs of digraphs with certain properties II. Hamiltonicity. Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 1, pp. 23-34. http://geodesic.mathdoc.fr/item/DMGT_2008_28_1_a1/