Edge colouring of \(K_{2n}\) with spanning star-forests receiving distinct colours
type: Item
instance of: scholarly article
title: Edge colouring of \(K_{2n}\) with spanning star-forests receiving distinct colours
zbMATH Open document ID: 0932.05031
author: Qi Zhang Liu
author: H. P. Yap
published in: Graphs and Combinatorics
publication date: 2000-03-13T00:00:00Z
review text: The authors prove that for any spanning star-forest \(S= S_{n_1} \cup\cdots \cup S_{n_k}\neq S_{2n-3} \cup S_1\) or \(2S_2\) (if \(n=3)\) of \(K_{2n}\), where \(n_i\geq 1\) for all \(i=1,2, \dots, k\), there exists an edge-colouring of \(K_{2n}\) using \(2n-1\) colours such that all the edges of \(S\) receive distinct colours. The proof given here is constructive and can be used for finding a required edge colouring. This result is useful in the study of total colourings of graphs (colourings of the adjacent and incident vertices and edges).
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1332857
zbMATH Keywords: algorithm
zbMATH Keywords: spanning star-forest
zbMATH Keywords: edge-colouring
reviewed by: Jozef Fiamčík
MaRDI profile type: Publication
full work available at URL: s003730050045
OpenAlex ID: W2078428854
DOI: 10.1007/S003730050045
description: scientific article; zbMATH DE number 1332857