Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
From MaRDI portal
Publication:3146988
DOI10.1017/S0963548302005175zbMath1001.05034OpenAlexW2080939161MaRDI QIDQ3146988
James G. Oxley, Dominic J. A. Welsh
Publication date: 2 December 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548302005175
Combinatorial aspects of matroids and geometric lattices (05B35) Complexity of computation (including implicit computational complexity) (03D15) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs ⋮ Tutte polynomial of pseudofractal scale-free web ⋮ On the complexity of matroid isomorphism problem ⋮ Phase diagram of the chromatic polynomial on a torus ⋮ A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges ⋮ A generalized Beraha conjecture for non-planar graphs ⋮ On the Complexity of Matroid Isomorphism Problems
This page was built for publication: Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
