On the public citation graph
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
0 signed · 78 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/aima.1995.1020openalex-snapshot
A Symmetric Function Generalization of the Chromatic Polynomial of a Graph
inferredcites →https://doi.org/10.1006/aima.1996.0018openalex-snapshot
The Path-Cycle Symmetric Function of a Digraph
inferredcites →https://doi.org/10.1006/jctb.1995.1055openalex-snapshot
On the Cover Polynomial of a Digraph
inferredcites →https://doi.org/10.1007/11604686_5openalex-snapshot
Approximating Rank-Width and Clique-Width Quickly
inferredcites →https://doi.org/10.1007/11917496_18openalex-snapshot
Computing Graph Polynomials on Graphs of Bounded Clique-Width
inferredcites →https://doi.org/10.1007/3-540-44622-2_19openalex-snapshot
Disjunctive Tautologies as Synchronisation Schemes
inferredcites →https://doi.org/10.1007/3-540-44622-2_27openalex-snapshot
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale
inferredcites →https://doi.org/10.1007/978-0-387-40054-9_2openalex-snapshot
Mathematics and Its Applications
inferredcites →https://doi.org/10.1007/978-1-4612-0701-6openalex-snapshot
Complexity and Real Computation
inferredcites →https://doi.org/10.1007/978-1-4684-0637-5_13openalex-snapshot
Generalized Rook Polynomials and Orthogonal Polynomials
inferredcites →https://doi.org/10.1007/978-3-319-06923-4openalex-snapshot
Advances in Applied Mathematics
inferredcites →https://doi.org/10.1007/978-3-662-04179-6openalex-snapshot
Completeness and Reduction in Algebraic Complexity Theory
inferredcites →https://doi.org/10.1007/978-3-662-07003-1openalex-snapshot
Elements of Finite Model Theory
inferredcites →https://doi.org/10.1007/bf01204715openalex-snapshot
Colorings and orientations of graphs
inferredcites →https://doi.org/10.1007/s00373-003-0544-xopenalex-snapshot
Chromatic Polynomials and the Symmetric Group
inferredcites →https://doi.org/10.1007/s00493-004-0035-6openalex-snapshot
A Two-Variable Interlace Polynomial
inferredcites →https://doi.org/10.1016/0012-365x(73)90108-8openalex-snapshot
Acyclic orientations of graphs
inferredcites →https://doi.org/10.1016/0012-365x(92)90289-ropenalex-snapshot
Tutte polynomials computable in polynomial time
inferredcites →https://doi.org/10.1016/0095-8956(79)90049-2openalex-snapshot
On a general class of graph polynomials
inferredcites →https://doi.org/10.1016/0166-218x(89)90049-8openalex-snapshot
A Tutte polynomial for signed graphs
inferredcites →https://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferredcites →https://doi.org/10.1016/j.dam.2004.01.016openalex-snapshot
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
inferredcites →https://doi.org/10.1016/j.jctb.2004.03.003openalex-snapshot
The interlace polynomial of a graph
inferredcites →https://doi.org/10.1016/s0012-365x(98)00113-7openalex-snapshot
An algorithm for the Tutte polynomials of graphs of bounded treewidth
inferredcites →https://doi.org/10.1016/s0022-0000(03)00080-1openalex-snapshot
The parametrized complexity of knot polynomials
inferredcites →https://doi.org/10.1016/s0196-8858(02)00530-4openalex-snapshot
Farrell polynomials on graphs of bounded tree width
inferredcites →https://doi.org/10.1016/s0196-8858(03)00087-3openalex-snapshot
On the algebraic complexity of some families of coloured Tutte polynomials
inferredcites →https://doi.org/10.1016/s0304-3975(02)00831-9openalex-snapshot
The Go polynomials of a graph
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1017/cbo9780511721328.004openalex-snapshot
The Penrose polynomial of graphs and matroids
inferredcites →https://doi.org/10.1017/cbo9780511734885.009openalex-snapshot
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
inferredcites →https://doi.org/10.1017/cbo9780511752506openalex-snapshot
Complexity: Knots, Colourings and Countings
inferredcites →https://doi.org/10.1017/s0305004100068936openalex-snapshot
On the computational complexity of the Jones and Tutte polynomials
inferredcites →https://doi.org/10.1017/s0963548398003447openalex-snapshot
A Tutte Polynomial for Coloured Graphs
inferredcites →https://doi.org/10.1017/s0963548398003551openalex-snapshot
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
inferredcites →https://doi.org/10.1051/ita/1992260302571openalex-snapshot
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
inferredcites →https://doi.org/10.1063/1.3060724openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.1090/s0002-9939-1988-0943099-0openalex-snapshot
Tutte Polynomials and Link Polynomials
inferredcites →https://doi.org/10.1109/icca.2002.1229256openalex-snapshot
Mathematics and its applications
inferredcites →https://doi.org/10.1112/s0024609396222416openalex-snapshot
FINITE MODEL THEORY (Perspectives in Mathematical Logic)
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1142/5814openalex-snapshot
Chromatic Polynomials and Chromaticity of Graphs
inferredcites →https://doi.org/10.1145/3749740.3749750openalex-snapshot
Completeness Classes in Algebra
inferredcites →https://doi.org/10.2307/1402058openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.2307/1967597openalex-snapshot
A Determinant Formula for the Number of Ways of Coloring a Map
inferredcites →https://doi.org/10.2307/2002374openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
inferredcites →https://doi.org/10.2307/2369302openalex-snapshot
On an Application of the New Atomic Theory to the Graphical Representation of the Invariants and Covariants of Binary Quantics, With Three Appendices, [Continued]
inferredcites →https://doi.org/10.5555/338219.338258openalex-snapshot
The interlace polynomial: a new graph polynomial
inferredcites →https://doi.org/10.5555/365411.365514openalex-snapshot
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width
inferredcites →https://doi.org/10.5860/choice.35-6275copenalex-snapshot
Complexity and real computation
inferredcites →https://doi.org/10.7151/dmgt.1049openalex-snapshot
Graph colorings with local constraints -- a survey
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_12openalex-snapshot
Complexity of the Bollobás-Riordan Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_25openalex-snapshot
On Counting Generalized Colorings
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_2openalex-snapshot
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_3openalex-snapshot
A Graph Polynomial Arising from Community Structure (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/s00224-007-9022-9openalex-snapshot
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
inferred← citeshttps://doi.org/10.1007/s00224-009-9213-7openalex-snapshot
Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions
inferred← citeshttps://doi.org/10.1007/s00453-012-9688-5openalex-snapshot
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
inferred← citeshttps://doi.org/10.1007/s10472-009-9115-zopenalex-snapshot
From Hilbert’s program to a logic tool box
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.03.017openalex-snapshot
The enumeration of vertex induced subgraphs with respect to the number of components
inferred← citeshttps://doi.org/10.1093/logcom/exq006openalex-snapshot
Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas
inferred← citeshttps://doi.org/10.2140/mt.2024.3.465openalex-snapshot
How I got to like graph polynomials
inferred← citeshttps://doi.org/10.3233/fi-2010-235openalex-snapshot
Tree-width in Algebraic Complexity
inferred← citeshttps://doi.org/10.37236/793openalex-snapshot
A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width
inferred← citeshttps://doi.org/10.48550/arxiv.0812.1364openalex-snapshot
Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702016openalex-snapshot
A multivariate interlace polynomial
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.