1729 search results - page 103 / 346 » On Bounds for the k-Partitioning of Graphs |
CCCG
2003
14 years 11 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
DM
2007
14 years 10 months ago
2007
We prove that the acyclic chromatic index a (G) 6 for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52 with the girth requirement g 220. We al...
COMBINATORICS
1999
14 years 9 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
116
click to vote
ISPD
2012
ACM
13 years 5 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
189
click to vote
COMBINATORICA
2011
13 years 9 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...