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

First Page		Document Content
Date: 2004-03-11 06:32:34 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 Source URL: community.dur.ac.uk Download Document from Source Website File Size: 153,42 KB Share Document on Facebook

	583 Documenta Math. A Common Recursion For Laplacians of Matroids and Shifted Simplicial Complexes DocID: 1r60o - View Document
	The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford DocID: 1r1Rx - View Document
	Takehome Exam Graph II Start: :00 am End: :00 pm 1. Given a graph G whose girth is greater then 10 provide an algorithm that DocID: 1q9l5 - View Document
	Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany Abstract. We consider the multivariate interlace polynomial introduced by Courc DocID: 1q2CQ - View Document
	COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res DocID: 1pNcL - View Document