Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9513243 | Discrete Mathematics | 2005 | 18 Pages |
Abstract
Let G be a graph in which each vertex has been coloured using one of k colours, say c1,c2,â¦,ck. If an m-cycle C in G has ni vertices coloured ci, i=1,2,â¦,k, and |ni-nj|⩽1 for any i,jâ{1,2,â¦,k}, then C is said to be equitably k-coloured. An m-cycle decomposition C of a graph G is equitably k-colourable if the vertices of G can be coloured so that every m-cycle in C is equitably k-coloured. For m= 3, 4 and 5 we completely settle the existence question for equitably 3-colourable m-cycle decompositions of complete equipartite graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
James Lefevre, Mary Waterhouse,