157 search results - page 17 / 32 » Frugal Colouring of Graphs |
DM
2010
13 years 9 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
CRYPTO
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
BIRTHDAY
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
ENDM
2010
13 years 9 months ago
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...