15 search results - page 2 / 3 » Acyclic improper colourings of graphs with bounded maximum d... |
ENDM
2007
14 years 11 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
106
click to vote
SIROCCO
2000
15 years 1 months ago
2000
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...
135
click to vote
GC
2011
Springer
14 years 6 months ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
90
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
JGT
2007
14 years 11 months ago
2007
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...