The Go polynomials of a graph.
From MaRDI portal
Publication:1426435
DOI10.1016/S0304-3975(02)00831-9zbMath1060.68084OpenAlexW2047555515MaRDI QIDQ1426435
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00831-9
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
On the number of go positions on lattice graphs ⋮ Counting Domineering Positions ⋮ The Polynomial Profile of Distance Games on Paths and Cycles ⋮ Sterling Stirling play ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials
Cites Work
- A correlation inequality involving stable set and chromatic polynomials
- Matching theory
- The Redei function of a relation
- Characteristic polynomials of weighted lattices
- A weighted graph polynomial from chromatic invariants of knots
- A characterization of Tutte invariants of 2-polymatroids
- Some results on generalised Whitney functions
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- A symmetric function generalization of the chromatic polynomial of a graph
- The Complexity of Enumeration and Reliability Problems
- GO Is Polynomial-Space Hard
- THE CRITICAL PROBLEM FOR POLYMATROIDS
- On a Correlation Inequality of Farr
- Mean value for the matching and dominating polynomial
- On the computational complexity of the Jones and Tutte polynomials
- A generalization of the Whitney rank generating function
- IMPROVED ESTIMATE FOR A LINEAR FORM OF THE LOGARITHMS OF ALGEBRAIC NUMBERS
- Computer Go
- Computer Go: An AI oriented survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
