65 search results - page 13 / 13 » A decomposition for total-coloring graphs of maximum degree ... |
SIAMDM
2010
13 years 3 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
TCS
2010
13 years 3 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
MOBIHOC
2004
ACM
14 years 4 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...