Sciweavers

3211 search results - page 480 / 643
» On the Grundy Number of a Graph
Sort
View
ARSCOM
2006
81views more  ARSCOM 2006»
13 years 9 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
GC
2008
Springer
13 years 9 months ago
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations
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...
Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...
CC
2006
Springer
133views System Software» more  CC 2006»
13 years 9 months ago
The complexity of chromatic strength and chromatic edge strength
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...
Dániel Marx
CORR
2006
Springer
68views Education» more  CORR 2006»
13 years 9 months ago
A rigorous proof of the cavity method for counting matchings
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...
Mohsen Bayati, Chandra Nair
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 9 months ago
A field-theory motivated approach to symbolic computer algebra
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 ...
Kasper Peeters