From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2741172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlace polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the Tutte polynomials of graphs of bounded treewidth / 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: The matching polynomial of a polygraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Cover Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte Polynomial for Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path-cycle symmetric function of a digraph / 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: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / 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: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results for the Martin polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Go polynomials of a graph. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metafinite model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique polynomials and independent set polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte Polynomials and Link Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte polynomial for signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Enumeration Problems in Geometry and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic complexity of some families of coloured Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768337 / 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: Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / 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: The parametrized complexity of knot polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Graph Polynomials on Graphs of Bounded Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting problems over the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte polynomials computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic polynomials and the symmetric group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetric function generalization of the chromatic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility by algebraic projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring mixed hypergraphs: theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank

Latest revision as of 12:56, 1 July 2024

scientific article
Language Label Description Also known as
English
From a zoo to a zoology: Towards a general theory of graph polynomials
scientific article

    Statements

    From a zoo to a zoology: Towards a general theory of graph polynomials (English)
    0 references
    0 references
    8 May 2009
    0 references
    graph polynomials
    0 references
    combinatorial counting functions
    0 references
    descriptive complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers