1729 search results - page 130 / 346 » On Bounds for the k-Partitioning of Graphs |
DAM
1999
14 years 10 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
40
Voted
PPL
1998
14 years 9 months ago
1998
In this paper, we describe an ordering of the vertices of a 2-dimensional torus and study the upper bound on the orderly broadcast time. Along with messy broadcasting, orderly bro...
IPL
2011
14 years 5 months ago
2011
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
86
Voted
JGT
2010
14 years 5 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
111
click to vote
CIAC
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...