Linear Recurrence Relations for Graph Polynomials (Q5452182): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-78127-1_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1535123574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interlace polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-variable interlace polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte Polynomial for Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover polynomial of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fusion in relational structures and the verification of monadic second-order properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex-cover polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spectra of sentences of monadic second order logic with counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modest theory of short chains. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between NLC-width and linear NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the theory of finite automata. Translated from the Russian. Translation edited by J.C. Shepherdson / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farrell polynomials on graphs of bounded tree width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively constructible families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of order / rank
 
Normal rank

Latest revision as of 18:57, 27 June 2024

scientific article; zbMATH DE number 5252782
Language Label Description Also known as
English
Linear Recurrence Relations for Graph Polynomials
scientific article; zbMATH DE number 5252782

    Statements

    Linear Recurrence Relations for Graph Polynomials (English)
    0 references
    0 references
    0 references
    25 March 2008
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references