![Graph coloring / Polynomials / Complexity classes / Matroid theory / Tutte polynomial / Chromatic polynomial / K-edge-connected graph / Matroid / Expander graph / NC Graph coloring / Polynomials / Complexity classes / Matroid theory / Tutte polynomial / Chromatic polynomial / K-edge-connected graph / Matroid / Expander graph / NC](https://www.pdfsearch.io/img/de6b2f6d6dc6ea62ba5a92877c360144.jpg) 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 | | 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 ofAdd to Reading ListSource URL: community.dur.ac.ukDownload Document from Source Website File Size: 153,42 KBShare Document on Facebook
|