A note on packing of two copies of a hypergraph
Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 1, pp. 45-49
Voir la notice de l'article provenant de la source Library of Science
A 2-packing of a hypergraph is a permutation σ on V() such that if an edge e belongs to (), then σ (e) does not belong to ().
Keywords:
packing, hypergraphs
@article{DMGT_2007_27_1_a4,
author = {Pil\'sniak, Monika and Wo\'zniak, Mariusz},
title = {A note on packing of two copies of a hypergraph},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {45--49},
publisher = {mathdoc},
volume = {27},
number = {1},
year = {2007},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a4/}
}
Pilśniak, Monika; Woźniak, Mariusz. A note on packing of two copies of a hypergraph. Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 1, pp. 45-49. http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a4/