383 search results - page 14 / 77 » A Bound on the Total Chromatic Number |
JGT
2008
13 years 7 months ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
SIROCCO
2007
13 years 9 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
MOC
1998
13 years 7 months ago
1998
Using a new regulator bound we determine unit groups and class groups of the 289040 quintic algebraic number fields with absolute discriminant less than 2 × 107 (totally real fi...