3204 search results - page 455 / 641 » The b-chromatic Number of a Graph |
161
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
149
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
147
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
182
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
199
click to vote
IJAHUC
2008
15 years 6 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...