On the alpha-labeling number of bipartite graphs

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	El-Zanati, S	en_US
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Shiue, CL	en_US
dc.date.accessioned	2019-04-02T05:58:47Z	-
dc.date.available	2019-04-02T05:58:47Z	-
dc.date.issued	2000-03-21	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0012-365X(99)00313-1	en_US
dc.identifier.uri	http://hdl.handle.net/11536/148468	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.subject	alpha-labeling	en_US
dc.subject	bipartite graph	en_US
dc.title	On the alpha-labeling number of bipartite graphs	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0012-365X(99)00313-1	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	214	en_US
dc.citation.spage	241	en_US
dc.citation.epage	243	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000085778400017	en_US
dc.citation.woscount	3	en_US
顯示於類別：	期刊論文