13 search results - page 3 / 3 » Acyclic Edge Colouring of Outerplanar Graphs |
LICS
2010
IEEE
13 years 3 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 ...
ENDM
2007
13 years 4 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
ORDER
2006
13 years 4 months ago
2006
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...