A graph polynomial for independent sets of bipartite graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1247.05111
DOI: 10.1017/S0963548312000296
author: Q. Ge
author: D. Štefankovič
published in: Combinatorics, Probability and Computing
publication date: 2012-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 6081447
zbMATH Keywords: matchings
zbMATH Keywords: graph polynomials
MaRDI profile type: Publication
cites work: Computational complexity of counting problems on 3-regular planar graphs
cites work: On the computational complexity of the Jones and Tutte polynomials
cites work: Counting independent sets up to the tree threshold
cites work: The complexity of counting in sparse, regular, and planar graphs
cites work: A Contribution to the Theory of Chromatic Polynomials
cites work: The computational complexity of two‐state spin systems
cites work: The Complexity of Ferromagnetic Ising with Local Fields
cites work: Dynamic Matrix Rank
cites work: On Counting Independent Sets in Sparse Graphs
cites work: Graph Polynomials and Their Applications II: Interrelations and Interpretations
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: Graph Polynomials and Their Applications I: The Tutte Polynomial
cites work: On Markov Chains for Independent Sets
cites work: An approximation trichotomy for Boolean \#CSP
cites work: Fast evaluation of interlace polynomials on graphs of bounded treewidth
cites work: The relative complexity of approximate counting problems
cites work: Q3999841
cites work: Q4888749
cites work: A two-variable interlace polynomial
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Prime divisors of the Lagarias sequence
cites work: A two-variable Artin conjecture
cites work: From a zoo to a zoology: Towards a general theory of graph polynomials
cites work: Fast convergence of the Glauber dynamics for sampling independent sets
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: Polynomial-Time Approximation Algorithms for the Ising Model
cites work: Q3140234
full work available at URL: s0963548312000296
OpenAlex ID: W2122924340
title: A graph polynomial for independent sets of bipartite graphs
description: scientific article; zbMATH DE number 6081447