Paper Info
Title
Edge Colouring of K2n with Spanning Star-Forests Receiving Distinct Colours
Abstract
.   Let S ni be a star of size n i and let S=S n1∪…∪S nk≠S 2n−3∪S 1 or S 2∪S 2 be a spanning star-forest of the complete graph K 2n. We prove that K 2n has a proper (2n−1)-edge-colouring such that all the edges of S receive distinct colours. This result is very useful in the study of total-colourings of graphs.
Year
DOI
Venue
1999
10.1007/s003730050045
Graphs and Combinatorics
DocType
Volume
Issue
Journal
15
2
ISSN
Citations 
PageRank 
1435-5914
0
0.34
References 
Authors
1
2
Name
Order
Citations
PageRank
H. P. Yap1669.62
Qizhang Liu2122.54