12 search results - page 3 / 3 » On the Acyclic Chromatic Number of Hamming Graphs |
DM
2010
14 years 11 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
153
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...