The Go polynomials of a graph.

DOI10.1016/S0304-3975(02)00831-9MaRDI QIDQ1426435zbMATH OpenOpenAlexFDO

Authors Graham Farr

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

zbMATH Keywords

graph polynomials

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• scientific article; zbMATH DE number 6378508
• The lattice polynomial of a graph.
• On the Polynomial of a Graph
• The graph polynomials and their equivalence
• On the generalized characteristic polynomial of a graph.
• The characteristic polynomial of a graph operation and its application.
• Polynomials on graphs
• Graph-polynomials
• Polynomials and graph homomorphisms
• scientific article; zbMATH DE number 13137

Cites work

• scientific article; zbMATH DE number 988832 (Why is no real title available?)
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 3784908 (Why is no real title available?)
• scientific article; zbMATH DE number 16388 (Why is no real title available?)
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 3465382 (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 3561452 (Why is no real title available?)
• scientific article; zbMATH DE number 475578 (Why is no real title available?)
• scientific article; zbMATH DE number 598464 (Why is no real title available?)
• scientific article; zbMATH DE number 1759687 (Why is no real title available?)
• scientific article; zbMATH DE number 1759698 (Why is no real title available?)
• A characterization of Tutte invariants of 2-polymatroids
• A correlation inequality involving stable set and chromatic polynomials
• A generalization of the Whitney rank generating function
• A symmetric function generalization of the chromatic polynomial of a graph
• A weighted graph polynomial from chromatic invariants of knots
• Characteristic polynomials of weighted lattices
• Computer Go
• Computer Go: An AI oriented survey
• GO Is Polynomial-Space Hard
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• IMPROVED ESTIMATE FOR A LINEAR FORM OF THE LOGARITHMS OF ALGEBRAIC NUMBERS
• Matching theory
• Mean value for the matching and dominating polynomial
• On a Correlation Inequality of Farr
• On the computational complexity of the Jones and Tutte polynomials
• Some results on generalised Whitney functions
• THE CRITICAL PROBLEM FOR POLYMATROIDS
• The Complexity of Enumeration and Reliability Problems
• The Redei function of a relation

Cited in

(7)

• The polynomial profile of distance games on paths and cycles
• On the number of go positions on lattice graphs
• Counting domineering positions
• Sterling Stirling play
• From a zoo to a zoology: Towards a general theory of graph polynomials
• Nakade -- a graph theoretic concept in Go
• The probabilistic method meets Go

This page was built for publication: The Go polynomials of a graph.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426435)