112 search results - page 5 / 23 » An edge colouring of multigraphs |
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
77
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...
COMBINATORICS
2006
14 years 10 months ago
2006
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...
123
Voted
GC
2011
Springer
14 years 5 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...
75
Voted
CPC
2008
14 years 10 months ago
2008
In 1998 Luczak, R