31 search results - page 3 / 7 » Colouring Vertices of Triangle-Free Graphs |
93
Voted
STOC
2009
ACM
15 years 6 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
81
Voted
DM
2010
14 years 11 months ago
2010
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...
86
Voted
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...
87
Voted
DM
2010
14 years 11 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
82
Voted
WDAG
2000
Springer
15 years 3 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...