112 search results - page 3 / 23 » An edge colouring of multigraphs |
DM
2000
13 years 9 months ago
2000
A variation of preemptive open shop scheduling corresponds to
TALG
2008
13 years 9 months ago
2008
COMBINATORICS
2006
13 years 9 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...
CCIW
2009
Springer
14 years 4 months ago
2009
Springer
Colour image representation using real quaternions has shown to be very useful for linear and morphological colour filtering. This paper deals with the extension of first derivat...
COLOGNETWENTE
2009
13 years 11 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...