Please use this identifier to cite or link to this item:
|Title:||Edge colorings of K2n with a prescribed condition - I|
|Authors:||Liu, Q.Z. |
Extention of edge-coloring
Partial latin square
|Source:||Liu, Q.Z.,Yap, H.P. (2000). Edge colorings of K2n with a prescribed condition - I. Discrete Mathematics 212 (3) : 233-244. ScholarBank@NUS Repository.|
|Abstract:||A graph L is called a lantern if it has two adjacent vertices u, v such that all the other vertices of L are adjacent to both u and v, and L has no other edges. Let L be a lantern of order 2n≥8. We prove that any edge-coloring of L using 2n-1 colors can be extended to a proper edge-coloring of K2n using the same set of colors. This result is used in some of our other papers on edge colorings of K2n. © 2000 Elsevier Science B.V. All rights reserved.|
|Source Title:||Discrete Mathematics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.