Pages that link to "Item:Q2908853"
From MaRDI portal
The following pages link to A graph polynomial for independent sets of bipartite graphs (Q2908853):
Displaying 12 items.
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- A counterexample to rapid mixing of the Ge-Stefankovic process (Q428729) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- A solution to Gutman's problem on the characteristic polynomial of a bipartite graph (Q1918564) (← links)
- Julia set of some graphs using independence polynomials (Q2067338) (← links)
- An algorithm for calculating the independence and vertex-cover polynomials of a graph (Q2383889) (← links)
- Approximately counting \(H\)-colorings is \(\#\)BIS-hard (Q2810271) (← links)
- On the independence polynomial of an antiregular graph (Q2857162) (← links)
- A graph polynomial for independent sets of bipartite graphs (Q2911069) (← links)
- Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard (Q3448813) (← links)
- Rapid mixing of Swendsen–Wang dynamics in two dimensions (Q5496948) (← links)
- Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
