Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IWPEC
2010
Springer
11 years 9 months ago
On the Grundy Number of a Graph
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
Frédéric Havet, Leonardo Sampaio
JUCS
2002
92views more  JUCS 2002»
11 years 11 months ago
Tiling the Hyperbolic Plane with a Single Pentagonal Tile
: In this paper, we study the number of tilings of the hyperbolic plane that can be constructed, starting from a single pentagonal tile, the only permitted transformations on the b...
Maurice Margenstern
DM
2002
82views more  DM 2002»
11 years 11 months ago
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmi...
Frédéric Havet, Janez Zerovnik
COMBINATORICS
2006
114views more  COMBINATORICS 2006»
11 years 11 months ago
Total 4-Choosability of Series-Parallel Graphs
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
Douglas R. Woodall
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
11 years 11 months ago
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
Catherine S. Greenhill, Andrzej Rucinski
DM
2008
95views more  DM 2008»
11 years 11 months ago
General neighbour-distinguishing index of a graph
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of t...
Ervin Györi, Mirko Hornák, Cory Palmer...
MM
2010
ACM
126views Multimedia» more  MM 2010»
11 years 12 months ago
The colour of life: novel visualisations of population lifestyles
Colour permeates our daily lives, yet we rarely take notice of it. In this work we utilise the SenseCam (a visual lifelogging tool), to investigte the predominant colours in one m...
Philip Kelly, Aiden R. Doherty, Alan F. Smeaton, C...
SIROCCO
2000
12 years 29 days ago
Lower bounds for (weak) sense of direction
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
Paolo Boldi, Sebastiano Vigna
APCHI
2004
IEEE
12 years 3 months ago
Nine Tools for Generating Harmonious Colour Schemes
We survey a number of tools that have been developed for generating sets of colours according to commonly accepted rules for colour harmony. Informal manual techniques for generati...
Paul J. Lyons, Giovanni S. Moretti
VISUALIZATION
1996
IEEE
12 years 3 months ago
Choosing Effective Colours for Data Visualization
In this paper we describe a technique for choosing multiple colours for use during data visualization. Our goal is a systematic method for maximizing the total number of colours a...
Christopher G. Healey
books