157 search results - page 22 / 32 » Frugal Colouring of Graphs |
100
click to vote
GD
2004
Springer
15 years 5 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
107
click to vote
SPE
2008
14 years 11 months ago
2008
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...
78
Voted
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
We present a method that automatically partitions a single image into non-overlapping regions coherent in texture and colour. An assumption that each textured or coloured region ca...
JCT
2007
14 years 11 months ago
2007
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...