Citations
Altmetric:
Alternative Title
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.
Keywords
Edge-coloring, Extention of edge-coloring, Partial latin square
Source Title
Discrete Mathematics
Publisher
Series/Report No.
Collections
Rights
Date
2000
DOI
Type
Article