@inbook{Fischer2008,
    Abstract = {A sequence of graphs Gnis iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gnbe a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Rib{\`o} have proven linear recurrences with polynomial coefficients for the Tutte polynomials T(Gi, x,y){\thinspace}={\thinspace}T(Gi), i.e.},
    Address = {Berlin, Heidelberg},
    Author = {Fischer, Eldar and Makowsky, Johann A.},
    BookTitle = {Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday},
    Editor = {Avron, Arnon and Dershowitz, Nachum and Rabinovich, Alexander},
    File = {Linear Recurrence Relations for Graph Polynomials - boaz85.pdf},
    ISBN = {978-3-540-78127-1},
    Pages = {266--279},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Linear Recurrence Relations for Graph Polynomials},
    URL = {https://doi.org/10.1007/978-3-540-78127-1\_15},
    Year = {2008},
    bdsk-url-1 = {https://doi.org/10.1007/978-3-540-78127-1\_15},
    date-added = {2022-08-29 14:38:31 +0200},
    date-modified = {2022-08-29 14:38:31 +0200},
    file-2 = {Linear Recurrence Relations for Graph Polynomials - 978-3-540-78127-1\_15.pdf},
    doi = {10.1007/978-3-540-78127-1_15}
}

@inbook{Fischer2008, Abstract = {A sequence of graphs Gnis iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gnbe a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Rib{`o} have proven linear recurrences with polynomial coefficients for the Tutte polynomials T(Gi, x,y){\thinspace}={\thinspace}T(Gi), i.e.}, Address = {Berlin, Heidelberg}, Author = {Fischer, Eldar and Makowsky, Johann A.}, BookTitle = {Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday}, Editor = {Avron, Arnon and Dershowitz, Nachum and Rabinovich, Alexander}, File = {Linear Recurrence Relations for Graph Polynomials - boaz85.pdf}, ISBN = {978-3-540-78127-1}, Pages = {266--279}, Publisher = {Springer Berlin Heidelberg}, Title = {Linear Recurrence Relations for Graph Polynomials}, URL = {https://doi.org/10.1007/978-3-540-78127-1_15}, Year = {2008}, bdsk-url-1 = {https://doi.org/10.1007/978-3-540-78127-1_15}, date-added = {2022-08-29 14:38:31 +0200}, date-modified = {2022-08-29 14:38:31 +0200}, file-2 = {Linear Recurrence Relations for Graph Polynomials - 978-3-540-78127-1_15.pdf}, doi = {10.1007/978-3-540-78127-1_15} }