Open Problems
Author:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 355-365
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Deterministic Algorithms for the Lovász Local Lemma2010
- A constructive proof of the general lovász local lemmaJournal of the ACM, 2010
- Quasi-kernels and quasi-sinks in infinite graphsDiscrete Mathematics, 2009
- The Grothendieck constant of random and pseudo-random graphsDiscrete Optimization, 2008
- On Counting Generalized Colorings2008
- Efficient approximation of convex recoloringsJournal of Computer and System Sciences, 2007
- Quadratic forms on graphsInventiones Mathematicae, 2005
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logicDiscrete Applied Mathematics, 2001
- Hard Enumeration Problems in Geometry and CombinatoricsSIAM Journal on Algebraic Discrete Methods, 1986
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979