Edge-colorings of K-m,K-n which Forbid Multicolored Cycles

dc.citation.epage	84	en_US
dc.citation.issue		en_US
dc.citation.spage	77	en_US
dc.citation.volume	90	en_US
dc.citation.woscount	0
dc.contributor.author	Fu, Hung-Lin	en_US
dc.contributor.author	Lo, Yuan-Hsun	en_US
dc.contributor.author	Pei, Ryo-Yu	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2014-12-08T15:31:37Z
dc.date.available	2014-12-08T15:31:37Z
dc.date.issued	2013-03-01	en_US
dc.description.abstract	A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we study the proper edge-colorings of the complete bipartite graph K-m,K-n which forbid multicolored cycles. Mainly, we prove that (1) for any integer k >= 2, if n >= 5k - 6, then any properly n-edge-colored K-k,K-n contains a multicolored C-2k, and (2) determine the order of the properly edge-colored complete bipartite graphs which forbid multicolored C-6.	en_US
dc.identifier.issn	0315-3681	en_US
dc.identifier.journal	UTILITAS MATHEMATICA	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/22415
dc.identifier.wosnumber	WOS:000319710700005
dc.language.iso	en_US	en_US
dc.subject	edge-coloring	en_US
dc.subject	complete bipartite graph	en_US
dc.subject	multicolored cycle	en_US
dc.title	Edge-colorings of K-m,K-n which Forbid Multicolored Cycles	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1