<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2004-03-11 06:32:34Graph coloring Polynomials Complexity classes Matroid theory Tutte polynomial Chromatic polynomial K-edge-connected graph Matroid Expander graph NC |
Add to Reading List |
| First Page | Document Content | |
|---|---|---|
Date: 2004-03-11 06:32:34Graph coloring Polynomials Complexity classes Matroid theory Tutte polynomial Chromatic polynomial K-edge-connected graph Matroid Expander graph NC |
Add to Reading List |
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