Back to Results
First PageMeta Content
Graph coloring / Polynomials / Complexity classes / Matroid theory / Tutte polynomial / Chromatic polynomial / K-edge-connected graph / Matroid / Expander graph / NC


c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of
Add to Reading List

Document Date: 2004-03-11 06:32:34


Open Document

File Size: 153,42 KB

Share Result on Facebook