4 search results - page 1 / 1 » Properly Coloured Hamiltonian Paths in Edge-coloured Complet... |
GC
2011
Springer
12 years 12 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...
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
DAM
1998
13 years 4 months ago
1998
We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the followi...
ACSAC
2003
IEEE
13 years 10 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...