On the alpha-labeling number of bipartite graphs
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
DOI
10.1016/S0012-365X(99)00313-1
Abstract
In this note we show that the alpha-labeling number of a bipartite graph G is bounded, which proves a conjecture of Snevily. (C) 2000 Elsevier Science B.V. All rights reserved.