31 search results - page 2 / 7 » Colouring Vertices of Triangle-Free Graphs |
69
Voted
DM
2008
14 years 9 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
DM
2010
14 years 9 months ago
2010
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...
COMBINATORICS
2006
14 years 9 months ago
2006
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...
DM
2008
14 years 9 months ago
2008
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...
SIROCCO
2000
14 years 10 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...