Some equitably 2-colourable cycle decompositions of multipartite graphs
| Contribuinte(s) |
H C Stewart J L Aliston W Goddard |
|---|---|
| Data(s) |
01/01/2006
|
| Resumo |
Let G be a graph in which each vertex has been coloured using one of k colours, say c(1), c(2),..., c(k). If an m-cycle C in G has x(i) vertices coloured c(i), i = 1, 2,..., k, and vertical bar x(i) - x(j)vertical bar |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Util Math Publ Inc |
| Palavras-Chave | #Mathematics, Applied #Statistics & Probability #Designs #Length #C1 #780101 Mathematical sciences #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics |
| Tipo |
Journal Article |
