Graph polynomials: some questions on the edge
From MaRDI portal
Cites work
- A characterization of Tutte invariants of 2-polymatroids
- A computational framework for the study of partition functions and graph polynomials
- A computer assisted study of Go on \(M \times N\) boards
- A Contribution to the Theory of Chromatic Polynomials
- A correlation inequality involving stable set and chromatic polynomials
- A determinant formula for the number of ways of coloring a map.
- A generalization of the Whitney rank generating function
- A little statistical mechanics for the graph theorist
- A logician's view of graph polynomials
- A Most General Edge Elimination Polynomial
- A partial analysis of Go
- A Set of Topological Invariants for Graphs
- A weighted graph polynomial from chromatic invariants of knots
- Acyclic orientations of graphs
- Algebraic invariants arising from the chromatic polynomials of theta graphs
- Algebraic properties of chromatic roots
- Algorithmic uses of the Feferman-Vaught theorem
- Algorithms on clique separable graphs
- An extension of the bivariate chromatic polynomial
- An infinite family of 2-connected graphs that have reliability factorisations
- An introduction to matching polynomials
- Beitrag zur Theorie des Ferromagnetismus
- Binary functions, degeneracy, and alternating dimaps
- Certificates for properties of stability polynomials of graphs
- Certificates of factorisation for a class of triangle-free graphs
- Certificates of factorisation for chromatic polynomials
- Chromatic invariants for finite graphs: Theme and polynomial variations
- Chromatic roots as algebraic integers
- Codichromatic graphs
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
- Cycle index, weight enumerator, and Tutte polynomial
- Farrell polynomials on graphs of bounded tree width
- Foundations of the chromatic polynomial
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Galois groups of chromatic polynomials
- George David Birkhoff and his mathematical work
- Graph polynomials: from recursive definitions to subset expansion formulas
- Graph theory and statistical physics
- Graph-polynomials
- Graphs on surfaces. Dualities, polynomials, and knots
- Harary polynomials
- Hopf algebras and Tutte polynomials
- scientific article; zbMATH DE number 1670492 (Why is no real title available?)
- scientific article; zbMATH DE number 3836093 (Why is no real title available?)
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 3885934 (Why is no real title available?)
- scientific article; zbMATH DE number 5168331 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3790458 (Why is no real title available?)
- scientific article; zbMATH DE number 3468904 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 475578 (Why is no real title available?)
- scientific article; zbMATH DE number 1151365 (Why is no real title available?)
- scientific article; zbMATH DE number 2038883 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- scientific article; zbMATH DE number 3276432 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- scientific article; zbMATH DE number 3422405 (Why is no real title available?)
- scientific article; zbMATH DE number 3049182 (Why is no real title available?)
- scientific article; zbMATH DE number 3076589 (Why is no real title available?)
- Irreducibility of the Tutte polynomial of a connected matroid
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen.
- Logical Approaches to Computational Barriers
- Mean value for the matching and dominating polynomial
- Network reliability analysis: Part I
- Non-bipartite chromatic factors
- On a class of polynomials associated with the cliques in a graph and its applications
- On counting generalized colorings
- On Counting Generalized Colorings
- On graph invariants given by linear recurrence relations
- On problems with short certificates
- On sequences of polynomials arising from graph invariants
- On the algebraic complexity of some families of coloured Tutte polynomials
- On the Ashkin–Teller Model and Tutte–Whitney Functions
- On the complexity of generalized chromatic polynomials
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- On the location of roots of graph polynomials
- On the number of go positions on lattice graphs
- On the theory of the matching polynomial
- Orbit-counting polynomials for graphs and codes
- Pairs of chromatically equivalent graphs
- Semantic equivalence of graph polynomials definable in second order logic
- Short certificates for chromatic equivalence
- Some results on generalised Whitney functions
- Strongly polynomial sequences as interpretations
- The coloring of graphs.
- The covered components polynomial: a new representation of the edge elimination polynomial
- The exact complexity of the Tutte polynomial
- The Go polynomials of a graph.
- The history of Tutte–Whitney polynomials
- The probabilistic method meets Go
- The theory of group-reduced distributions.
- The Tutte polynomial and knot theory
- Topological extensions of the Tutte polynomial
- Transforms and minors for binary functions
- Tutte-Whitney polynomials: some history and generalizations
This page was built for publication: Graph polynomials: some questions on the edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7236645)
