Sciweavers

88
Voted
BIRTHDAY
2008
Springer
15 years 8 days ago
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
Eldar Fischer, Johann A. Makowsky