3204 search results - page 264 / 641 » The b-chromatic Number of a Graph |
83
Voted
DM
2008
15 years 25 days ago
2008
Given a simple graph G on n vertices, we prove that it is possible to reconstruct several algebraic properties of the edge ideal from the deck of G, that is, from the collection o...
90
Voted
COMBINATORICS
2006
15 years 24 days ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
93
Voted
COMBINATORICS
2006
15 years 24 days ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
88
Voted
CORR
2006
Springer
15 years 24 days ago
2006
Springer
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
57
Voted
IPL
2006
15 years 22 days ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...