Some equitably 3-colourable cycle decompositions
type: Item
instance of: scholarly article
title: Some equitably 3-colourable cycle decompositions
zbMATH Open document ID: 1045.05024
author: Mary Waterhouse
author: P. Adams
author: Darryn Bryant
author: James Lefevre
published in: Discrete Mathematics
publication date: 2004-08-20T00:00:00Z
review text: An \(m\)-cycle is equitably \(k\)-coloured if the vertices of the cycle are coloured so that for each two colours the number of vertices of one colour and the number of the other differ by at most one. An \(m\)-cycle decomposition of a graph \(G\) is equitably \(k\)-coloured if the vertices of \(G\) are assigned colours so that each \(m\)-cycle in the decomposition is equitably \(k\)-coloured. For \(m\in \{4,5,6\}\), conditions for the existence of an equitably \(k\)-coloured \(m\)-cycle decomposition of the complete graph, and of the complete graph minus a perfect matching, are determined.
reviewed by: Charles J. Colbourn
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05B07
zbMATH DE Number: 2093764
zbMATH Keywords: graph colourings
zbMATH Keywords: cycle decompositions
zbMATH Keywords: equitable colourings
MaRDI profile type: Publication
full work available at URL: j.disc.2003.11.019
OpenAlex ID: W1978620023
cites work: Q3070192
cites work: Cycle decompositions of \(K_n\) and \(K_n-I\)
cites work: Bicoloring Steiner triple systems
cites work: Q4256358
cites work: Upper chromatic number of Steiner triple and quadruple systems
cites work: Strict colouring for classes of Steiner triple systems
cites work: Colouring Steiner systems with specified block colour patterns
cites work: Cycle decompositions. III: Complete graphs and fixed length cycles.
cites work: Colouring \(4\)-cycle systems with specified block colour patterns: The case of embedding \(P_3\)-designs
DOI: 10.1016/J.DISC.2003.11.019
description: scientific article; zbMATH DE number 2093764