Title of article
On special numberings of hypergraphs Original Research Article
Author/Authors
Günter Schaar، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
8
From page
261
To page
268
Abstract
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple finite hypergraph has an Egyptian edge-numbering. Moreover, it is shown that for every r⩾3 there exist arbitrarily large r-uniform connected finite hypergraphs not having an antimagic edge-numbering.
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950333
Link To Document